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 10, 2026 18:43Josu San MartinJosu San MartinScore: 3,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:433,85243,222,79630,903,0001,069,0002,113,536
2May 10, 2026 18:433,85639,847,09830,903,0001,107,0002,113,536
3May 10, 2026 18:433,86141,424,23830,985,0001,069,0002,113,536
4May 10, 2026 18:433,87239,934,65231,042,0001,097,0002,113,536
5May 10, 2026 18:433,88141,158,34531,140,0001,075,0002,113,536
6May 10, 2026 18:433,88341,408,11831,162,0001,071,0002,113,536
7May 10, 2026 18:433,89442,174,81331,242,0001,081,0002,113,536
8May 10, 2026 18:433,89939,988,43531,276,0001,088,0002,113,536
9May 10, 2026 18:433,90141,682,35031,312,0001,070,0002,113,536