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 17:09caandocaandoScore: 5,273Success
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 17:095,25270,423,88843,589,00002,510,848
2Mar 4, 2026 17:095,25776,530,03042,620,0001,014,0002,519,040
3Mar 4, 2026 17:095,26875,795,95241,739,0001,987,0002,510,848
4Mar 4, 2026 17:095,27372,443,68340,779,0002,983,0002,289,664
5Mar 4, 2026 17:095,27371,686,01341,780,0001,989,0002,523,136
6Mar 4, 2026 17:095,28468,296,55542,862,000996,0002,269,184