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 listFeb 21, 2026 18:40Daniel MastalerzDaniel MastalerzScore: 15,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:4015,396152,238,327124,795,0002,995,0002,265,088
2Feb 21, 2026 18:4015,401155,672,450123,838,0003,994,0002,326,528
3Feb 21, 2026 18:4015,407149,342,914124,877,0002,997,0002,326,528
4Feb 21, 2026 18:4015,410153,163,923123,905,0003,996,0002,326,528
5Feb 21, 2026 18:4015,421151,503,506125,995,0001,999,0002,306,048
6Feb 21, 2026 18:4015,532154,341,756125,916,0002,998,0002,514,944