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 24, 2026 17:23Victor MerckléVictor MerckléScore: 6,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 17:245,98758,312,14248,640,0001,056,0002,113,536
2May 24, 2026 17:245,99658,336,85248,709,0001,060,0002,113,536
3May 24, 2026 17:246,01159,351,26248,826,0001,067,0002,113,536
4May 24, 2026 17:246,01458,713,71448,916,0001,001,0002,113,536
5May 24, 2026 17:246,03061,022,60949,051,0001,001,0002,113,536
6May 24, 2026 17:246,04559,841,04749,144,0001,033,0002,113,536
7May 24, 2026 17:246,04558,217,19949,171,0001,008,0002,113,536
8May 24, 2026 17:246,15561,019,40250,086,0001,002,0002,113,536
9May 24, 2026 17:246,20159,331,06550,474,0001,001,0002,113,536