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 11, 2026 19:54Victor MerckléVictor MerckléScore: 10,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 19:5710,02691,964,56582,070,0001,149,0002,117,632stderr
2Sep 11, 2026 19:5710,04592,095,21282,267,0001,113,0002,117,632stderr
3Sep 11, 2026 19:5710,04992,206,46782,265,0001,149,0002,117,632stderr
4Sep 11, 2026 19:5710,11092,654,37082,912,0001,009,0002,117,632stderr
5Sep 11, 2026 19:5710,12693,390,45882,996,0001,057,0002,117,632stderr
6Sep 11, 2026 19:5710,16693,709,03983,266,0001,116,0002,117,632stderr
7Sep 11, 2026 19:5710,18193,256,06183,367,0001,142,0002,117,632stderr
8Sep 11, 2026 19:5710,363104,199,57185,010,0001,007,0002,117,632stderr
9Sep 11, 2026 19:5710,618104,161,72587,122,0001,012,0002,117,632stderr