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 4, 2026 00:17Josu San MartinJosu San MartinScore: 8,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:188,81282,448,46471,114,0002,028,0002,113,536
2Jul 4, 2026 00:188,86482,940,94871,529,0002,050,0002,113,536
3Jul 4, 2026 00:188,86782,992,92971,550,0002,050,0002,113,536
4Jul 4, 2026 00:188,90083,238,25171,841,0002,030,0002,113,536
5Jul 4, 2026 00:188,97983,981,18571,507,0003,024,0002,113,536
6Jul 4, 2026 00:189,09884,859,14672,459,0003,062,0002,113,536
7Jul 4, 2026 00:189,10184,921,68073,515,0002,029,0002,113,536
8Jul 4, 2026 00:189,24386,199,63074,676,0002,043,0002,113,536
9Jul 4, 2026 00:189,35988,633,52374,631,0003,056,0002,113,536