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 7, 2026 05:25Josu San MartinJosu San MartinScore: 5,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2026 05:255,66869,381,03945,042,0002,001,0002,531,328
2Mar 7, 2026 05:255,72071,623,19446,465,0001,010,0002,514,944
3Mar 7, 2026 05:255,79470,877,78446,087,0002,003,0002,514,944
4Mar 7, 2026 05:255,82579,526,74147,338,0001,007,0002,506,752
5Mar 7, 2026 05:255,83676,381,83148,435,00002,293,760
6Mar 7, 2026 05:255,91175,681,74047,059,0002,002,0002,359,296