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 9, 2026 04:25Milo PresedoMilo PresedoScore: 8,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 04:258,23388,205,91867,312,0001,027,0002,359,296
2May 9, 2026 04:258,23685,209,40267,339,0001,025,0002,371,584
3May 9, 2026 04:258,23682,641,33667,339,0001,027,0002,359,296
4May 9, 2026 04:258,23784,739,81967,348,0001,025,0002,359,296
5May 9, 2026 04:258,23885,422,00267,358,0001,025,0002,367,488
6May 9, 2026 04:258,25184,983,97967,462,0001,027,0002,351,104
7May 9, 2026 04:258,25287,185,58167,467,0001,027,0002,351,104
8May 9, 2026 04:258,26187,340,83167,541,0001,027,0002,367,488
9May 9, 2026 04:258,27086,036,01967,617,0001,030,0002,363,392