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 05:23Victor MerckléVictor MerckléScore: 7,012Success
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 05:236,96567,350,07057,811,00002,113,536
2May 15, 2026 05:236,97065,142,78657,857,00002,113,536
3May 15, 2026 05:236,97265,519,22756,859,0001,010,0002,113,536
4May 15, 2026 05:236,98767,377,38457,997,00002,113,536
5May 15, 2026 05:237,01265,703,47558,200,00002,113,536
6May 15, 2026 05:237,01667,732,87357,192,0001,047,0002,113,536
7May 15, 2026 05:237,01968,428,25058,260,00002,113,536
8May 15, 2026 05:237,01965,555,47957,255,0001,005,0002,113,536
9May 15, 2026 05:237,08766,488,04757,807,0001,023,0002,113,536