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 15, 2025 20:44Safronov AlekseiSafronov AlekseiScore: 50,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 20:4450,160442,986,089414,327,0002,001,0002,277,376
2Jul 15, 2025 20:4450,162437,273,278415,342,0001,000,0002,277,376
3Jul 15, 2025 20:4450,165440,239,246416,371,00002,265,088
4Jul 15, 2025 20:4450,167444,845,919414,386,0002,001,0002,277,376
5Jul 15, 2025 20:4450,168450,835,222415,394,0001,000,0002,277,376
6Jul 15, 2025 20:4450,181441,189,769414,502,0001,997,0002,277,376
7Jul 15, 2025 20:4450,190443,243,584413,581,0002,996,0002,277,376
8Jul 15, 2025 20:4450,199446,049,336412,658,0003,996,0002,277,376
9Jul 15, 2025 20:4450,199447,714,452414,657,0001,998,0002,273,280