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 listNov 4, 2025 18:20caandocaandoScore: 6,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 18:205,82473,026,14747,335,0001,007,0002,265,088
2Nov 4, 2025 18:205,85773,367,25747,603,0001,012,0002,265,088
3Nov 4, 2025 18:205,88876,873,63546,873,0001,994,0002,285,568
4Nov 4, 2025 18:206,00375,649,47248,827,000996,0002,531,328
5Nov 4, 2025 18:206,01471,262,28748,922,000998,0002,281,472
6Nov 4, 2025 18:206,02480,801,91447,997,0001,999,0002,285,568