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 15, 2026 23:32Victor 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 15, 2026 23:32067,224,80357,685,00002,113,536expected "53692585155064289 ", got "53692582851064289 "
2May 15, 2026 23:326,94666,695,51456,655,0001,002,0002,113,536
3May 15, 2026 23:326,94665,504,01757,654,00002,113,536
4May 15, 2026 23:326,94665,426,71356,642,0001,010,0002,113,536
5May 15, 2026 23:326,95166,820,63857,700,00002,113,536
6May 15, 2026 23:326,95368,375,69956,702,0001,011,0002,113,536
7May 15, 2026 23:327,12668,745,06359,151,00002,113,536
8May 15, 2026 23:327,12666,488,78459,153,00002,113,536
9May 15, 2026 23:327,18166,895,81159,610,00002,113,536