Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 18, 2026 19:21Yuriy LyfenkoYuriy LyfenkoScore: 4,579Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 19:204,51857,551,57636,483,0001,013,0002,469,888
2Mar 18, 2026 19:204,53062,455,55436,586,0001,016,0002,310,144
3Mar 18, 2026 19:214,53066,571,40736,580,0001,016,0002,531,328
4Mar 18, 2026 19:204,53163,126,38537,608,00002,473,984
5Mar 18, 2026 19:204,53367,585,37736,605,0001,016,0002,531,328
6Mar 18, 2026 19:204,57462,080,84035,970,0001,998,0002,478,080
7Mar 18, 2026 19:214,57957,020,31736,008,0002,000,0002,531,328
8Mar 18, 2026 19:204,64864,769,69737,567,0001,015,0002,465,792
9Mar 18, 2026 19:204,65367,138,98237,606,0001,016,0002,531,328
10Mar 18, 2026 19:214,65565,291,83737,622,0001,016,0002,531,328
11Mar 18, 2026 19:204,65961,930,61337,656,0001,017,0002,531,328
12Mar 18, 2026 19:204,66064,279,92436,696,0001,983,0002,461,696