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 listSep 17, 2026 01:33Andrew EpsteinAndrew EpsteinScore: 6,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:336,79566,544,46655,257,0001,146,0002,117,632stderr
2Sep 17, 2026 01:336,80666,714,45055,357,0001,139,0002,117,632stderr
3Sep 17, 2026 01:336,85967,111,12955,794,0001,138,0002,117,632stderr
4Sep 17, 2026 01:336,86067,034,63755,802,0001,140,0002,117,632stderr
5Sep 17, 2026 01:336,87367,228,03955,921,0001,132,0002,117,632stderr
6Sep 17, 2026 01:336,89067,361,89056,050,0001,141,0002,117,632stderr
7Sep 17, 2026 01:336,92068,469,04456,296,0001,142,0002,117,632stderr
8Sep 17, 2026 01:336,94967,868,02056,530,0001,147,0002,117,632stderr
9Sep 17, 2026 01:336,96667,928,74656,678,0001,144,0002,117,632stderr