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 listJul 3, 2026 23:38Josu San MartinJosu San MartinScore: 7,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 23:407,44871,223,00758,655,0003,167,0002,113,536
2Jul 3, 2026 23:407,50571,685,33759,165,0003,132,0002,113,536
3Jul 3, 2026 23:407,53671,817,48159,345,0003,204,0002,113,536
4Jul 3, 2026 23:407,54572,037,03459,490,0003,140,0002,113,536
5Jul 3, 2026 23:407,56172,258,82459,661,0003,098,0002,113,536
6Jul 3, 2026 23:407,59081,061,89959,785,0003,217,0002,113,536
7Jul 3, 2026 23:407,59272,350,87759,773,0003,242,0002,113,536
8Jul 3, 2026 23:407,62272,549,56260,040,0003,223,0002,113,536
9Jul 3, 2026 23:407,94983,158,12462,811,0003,167,0002,113,536