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 listMay 10, 2026 06:18Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 06:19050,573,99133,641,0001,052,0002,494,464expected "53680569394365824 ", got "53680787396794578 "
2May 10, 2026 06:194,15249,599,03233,385,0001,084,0002,486,272
3May 10, 2026 06:194,15350,245,75233,361,0001,112,0002,486,272
4May 10, 2026 06:194,16748,697,29533,495,0001,094,0002,482,176
5May 10, 2026 06:194,16852,322,46933,444,0001,154,0002,486,272
6May 10, 2026 06:194,16950,652,69433,488,0001,120,0002,494,464
7May 10, 2026 06:194,17052,901,91433,578,0001,035,0002,478,080
8May 10, 2026 06:194,19150,876,09733,721,0001,067,0002,478,080
9May 10, 2026 06:194,21952,747,45033,881,0001,143,0002,490,368