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 22, 2026 23:10wnwnScore: 4,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 23:124,39366,111,76535,450,0001,012,0002,490,368
2Feb 22, 2026 23:124,39861,815,80535,490,0001,014,0002,494,464
3Feb 22, 2026 23:134,39964,018,16835,501,0001,014,0002,535,424
4Feb 22, 2026 23:104,40461,392,51435,535,0001,015,0002,498,560
5Feb 22, 2026 23:134,40666,641,64835,556,0001,015,0002,498,560
6Feb 22, 2026 23:124,41062,304,81235,591,0001,016,0002,535,424
7Feb 22, 2026 23:104,41365,169,31735,611,0001,017,0002,494,464
8Feb 22, 2026 23:134,41761,818,01635,640,0001,018,0002,490,368
9Feb 22, 2026 23:104,42060,565,10035,666,0001,019,0002,535,424