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 4, 2026 17:12caandocaandoScore: 5,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 17:125,13766,921,82440,606,0002,030,0002,289,664
2Mar 4, 2026 17:125,15868,974,65839,826,0002,987,0002,506,752
3Mar 4, 2026 17:125,15965,826,14140,831,0001,991,0002,277,376
4Mar 4, 2026 17:125,16172,875,47240,846,0001,992,0002,514,944
5Mar 4, 2026 17:125,18361,399,11841,020,0002,001,0002,269,184
6Mar 4, 2026 17:125,18670,420,95041,041,0002,002,0002,510,848