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 listMar 20, 2026 00:03olliecrowolliecrowScore: 5,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 00:025,79869,111,52047,118,0001,002,0002,506,752
2Mar 20, 2026 00:025,81072,829,34545,206,0003,013,0002,408,448
3Mar 20, 2026 00:035,83568,401,92346,413,0002,017,0002,334,720
4Mar 20, 2026 00:035,84069,480,30845,444,0003,029,0002,461,696
5Mar 20, 2026 00:035,88078,380,13745,818,0002,988,0002,371,584
6Mar 20, 2026 00:025,95673,403,13047,417,0002,017,0002,482,176