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 16, 2026 17:34Victor MerckléVictor MerckléScore: 45,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 17:3845,522388,365,807376,793,0001,044,0002,117,632stderr
2Sep 16, 2026 17:3845,531389,660,403376,845,0001,063,0002,117,632stderr
3Sep 16, 2026 17:3845,668389,084,308377,966,0001,082,0002,117,632stderr
4Sep 16, 2026 17:3845,702389,107,078378,326,0001,005,0002,117,632stderr
5Sep 16, 2026 17:3845,703389,866,384378,160,0001,180,0002,117,632stderr
6Sep 16, 2026 17:3845,722389,397,786378,411,0001,088,0002,117,632stderr
7Sep 16, 2026 17:3845,726389,322,290378,526,0001,005,0002,117,632stderr
8Sep 16, 2026 17:3845,782390,430,589378,995,0001,001,0002,117,632stderr
9Sep 16, 2026 17:3845,798390,658,608379,084,0001,044,0002,117,632stderr