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 listSep 12, 2026 14:59Kevin HeaveyKevin HeaveyScore: 3,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:003,63140,386,63028,932,0001,207,0002,117,632
2Sep 12, 2026 15:003,72841,219,78629,720,0001,227,0002,117,632
3Sep 12, 2026 15:003,73141,184,98029,736,0001,232,0002,121,728
4Sep 12, 2026 15:003,74341,328,09230,027,0001,041,0002,117,632
5Sep 12, 2026 15:003,83942,139,29630,616,0001,248,0002,117,632
6Sep 12, 2026 15:003,85242,220,84130,897,0001,077,0002,117,632
7Sep 12, 2026 15:003,87042,278,92430,889,0001,232,0002,117,632
8Sep 12, 2026 15:003,90942,710,77231,208,0001,240,0002,117,632
9Sep 12, 2026 15:003,91542,775,14931,462,0001,039,0002,117,632