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 8, 2026 13:08Victor MerckléVictor MerckléScore: 30,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 13:1329,954257,713,027245,521,0003,100,0002,117,632stderr
2Sep 8, 2026 13:1330,014258,137,835247,109,0002,012,00024,576stderr
3Sep 8, 2026 13:1330,068258,158,282246,405,0003,167,00024,576stderr
4Sep 8, 2026 13:1330,105259,027,322245,932,0003,941,0002,117,632stderr
5Sep 8, 2026 13:1330,123258,607,219247,084,0002,940,0002,117,632stderr
6Sep 8, 2026 13:1330,124259,401,319246,906,0003,128,00024,576stderr
7Sep 8, 2026 13:1330,124258,488,739246,964,0003,067,0002,117,632stderr
8Sep 8, 2026 13:1330,140258,608,221246,125,0004,043,0002,117,632stderr
9Sep 8, 2026 13:1330,201259,123,591246,432,0004,242,0002,117,632stderr