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 04:26Victor MerckléVictor MerckléScore: 6,986Success
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 04:266,96366,945,84456,752,0001,043,0002,113,536
2May 15, 2026 04:266,96467,347,83057,806,00002,113,536
3May 15, 2026 04:266,96767,212,37157,828,00002,113,536
4May 15, 2026 04:266,97267,291,51256,859,0001,010,0002,113,536
5May 15, 2026 04:266,98667,548,71156,893,0001,092,0002,113,536
6May 15, 2026 04:267,01865,936,92258,252,00002,113,536
7May 15, 2026 04:267,02265,872,84658,288,00002,113,536
8May 15, 2026 04:267,02866,272,53957,324,0001,009,0002,113,536
9May 15, 2026 04:267,03265,976,02057,358,0001,008,0002,113,536