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 19, 2026 21:07lipapipalipapipaScore: 5,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:075,68769,252,76745,198,0002,008,0002,375,680
2Feb 19, 2026 21:075,69676,260,19743,252,0004,023,0002,371,584
3Feb 19, 2026 21:075,71871,642,35647,462,00002,359,296
4Feb 19, 2026 21:075,81475,541,22445,238,0003,015,0002,363,392
5Feb 19, 2026 21:075,81774,766,64945,267,0003,017,0002,371,584
6Feb 19, 2026 21:075,82765,674,20945,339,0003,022,0002,359,296
7Feb 19, 2026 21:075,84876,412,22147,527,0001,011,0002,371,584
8Feb 19, 2026 21:075,88174,065,38845,825,0002,988,0002,314,240
9Feb 19, 2026 21:075,92276,231,53946,143,0003,009,0002,371,584
10Feb 19, 2026 21:075,93771,297,89246,261,0003,017,0002,363,392
11Feb 19, 2026 21:075,97677,901,47548,611,000992,0002,285,568
12Feb 19, 2026 21:076,06876,276,89148,350,0002,014,0002,293,760