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 16, 2026 00:02Victor MerckléVictor MerckléScore: 6,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:026,95066,339,68256,640,0001,046,0002,113,536
2May 16, 2026 00:026,95164,953,71656,690,0001,009,0002,113,536
3May 16, 2026 00:026,95266,498,25456,696,0001,008,0002,113,536
4May 16, 2026 00:026,95465,282,01357,724,00002,113,536
5May 16, 2026 00:026,95566,320,61156,700,0001,031,0002,113,536
6May 16, 2026 00:026,95565,066,45656,723,0001,004,0002,113,536
7May 16, 2026 00:026,95865,065,79656,757,0001,001,0002,113,536
8May 16, 2026 00:027,01166,914,50957,144,0001,048,0002,113,536
9May 16, 2026 00:027,09169,131,82157,818,0001,045,0002,113,536