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 15:09Andrew EpsteinAndrew EpsteinScore: 141,946Success
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 15:12141,6341,186,593,8891,173,539,0002,026,0002,117,632stderr
2Sep 17, 2026 15:12141,6801,188,436,6491,173,913,0002,034,0002,117,632stderr
3Sep 17, 2026 15:12141,8651,188,527,2861,175,476,0002,008,0002,117,632stderr
4Sep 17, 2026 15:12141,9251,188,182,5751,176,971,0001,007,0002,117,632stderr
5Sep 17, 2026 15:12141,9461,188,707,2361,177,150,0001,006,0002,117,632stderr
6Sep 17, 2026 15:12141,9511,190,351,3811,176,169,0002,030,0002,117,632stderr
7Sep 17, 2026 15:12141,9621,188,522,7931,177,286,0001,001,0002,117,632stderr
8Sep 17, 2026 15:12141,9801,188,740,5161,177,426,0001,009,0002,117,632stderr
9Sep 17, 2026 15:12142,4231,192,567,5521,181,106,0001,007,0002,117,632stderr