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 4, 2026 22:30olliecrowolliecrowScore: 5,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 22:305,53772,554,70843,956,0001,998,0002,514,944
2Mar 4, 2026 22:305,66472,741,68345,015,0002,000,0002,392,064
3Mar 4, 2026 22:305,70479,285,31545,330,0002,014,0002,441,216
4Mar 4, 2026 22:305,90280,882,45445,991,0002,999,0002,490,368
5Mar 4, 2026 22:306,03580,021,60548,090,0002,003,0002,449,408
6Mar 4, 2026 22:306,12674,041,99448,855,0001,994,0002,510,848