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 23, 2026 16:39satoru.netsatoru.netScore: 35,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 16:3935,241324,750,324291,499,0001,001,0002,277,376
2Feb 23, 2026 16:3935,243322,740,673292,514,00002,277,376
3Feb 23, 2026 16:3935,262317,030,030290,675,0001,997,0002,400,256
4Feb 23, 2026 16:3935,263317,714,815290,683,0001,997,0002,400,256
5Feb 23, 2026 16:3935,264322,304,395290,698,0001,997,0002,396,160
6Feb 23, 2026 16:3935,264315,448,548290,696,0001,997,0002,277,376
7Feb 23, 2026 16:3935,265318,162,696290,702,0001,997,0002,277,376
8Feb 23, 2026 16:3935,267321,980,700290,714,0001,998,0002,277,376
9Feb 23, 2026 16:3935,277322,841,080290,805,0001,998,0002,392,064