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 listMay 10, 2026 14:07Josu San MartinJosu San MartinScore: 4,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 14:084,17645,037,06733,622,0001,041,0002,113,536
2May 10, 2026 14:084,17944,563,16433,657,0001,035,0002,113,536
3May 10, 2026 14:084,17944,780,98733,653,0001,034,0002,113,536
4May 10, 2026 14:084,18045,302,47733,672,0001,028,0002,113,536
5May 10, 2026 14:084,18242,336,70933,662,0001,053,0002,113,536
6May 10, 2026 14:084,18644,042,25633,696,0001,056,0002,113,536
7May 10, 2026 14:084,19942,361,50133,834,0001,019,0002,113,536
8May 10, 2026 14:084,20145,222,84933,817,0001,052,0002,113,536
9May 10, 2026 14:084,27843,077,86934,470,0001,039,0002,113,536