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 6, 2026 20:00caandocaandoScore: 11,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 20:0011,032121,504,56490,563,0001,006,0002,527,232
2Mar 6, 2026 20:0011,057120,594,06989,775,0001,995,0002,281,472
3Mar 6, 2026 20:0011,268119,609,13392,521,0001,005,0002,519,040
4Mar 6, 2026 20:0011,908121,553,72797,839,000998,0002,265,088
5Mar 6, 2026 20:0011,925122,651,17496,981,0001,999,0002,281,472
6Mar 6, 2026 20:0012,164124,828,36098,962,0001,999,0002,519,040