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 6, 2026 18:04Josu San MartinJosu San MartinScore: 5,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:045,43867,006,90242,129,0003,009,0002,371,584
2Mar 6, 2026 18:045,54567,469,83544,026,0002,001,0002,277,376
3Mar 6, 2026 18:045,55277,375,73644,079,0002,003,0002,277,376
4Mar 6, 2026 18:045,71774,404,04845,429,0002,019,0002,277,376
5Mar 6, 2026 18:045,73672,360,84147,611,00002,367,488
6Mar 6, 2026 18:045,76075,682,21046,815,000996,0002,363,392