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 listMay 21, 2026 10:56Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 10:57046,789,94737,806,0001,025,0002,113,536expected "53685225492599366 ", got "53685225492343366 "
2May 21, 2026 10:574,66246,545,04637,619,0001,076,0002,113,536
3May 21, 2026 10:574,67246,654,88737,710,0001,072,0002,113,536
4May 21, 2026 10:574,68348,296,39437,849,0001,028,0002,113,536
5May 21, 2026 10:574,68749,944,83337,873,0001,033,0002,113,536
6May 21, 2026 10:574,69247,369,94337,907,0001,040,0002,113,536
7May 21, 2026 10:574,69747,902,91237,983,0001,004,0002,113,536
8May 21, 2026 10:574,70146,912,18237,976,0001,045,0002,113,536
9May 21, 2026 10:574,71047,250,30238,033,0001,067,0002,113,536