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 13, 2026 22:37flavio87flavio87Score: 6,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 22:386,19359,116,83850,386,0001,017,0002,113,536
2May 13, 2026 22:386,27862,235,16251,084,0001,031,0002,113,536
3May 13, 2026 22:386,29060,624,94451,180,0001,030,0002,113,536
4May 13, 2026 22:386,30062,406,94451,277,0001,019,0002,113,536
5May 13, 2026 22:386,30662,531,97051,320,0001,025,0002,113,536
6May 13, 2026 22:386,30762,016,90451,337,0001,017,0002,113,536
7May 13, 2026 22:386,32363,306,63051,472,0001,016,0002,113,536
8May 13, 2026 22:386,33360,760,18451,551,0001,017,0002,113,536
9May 13, 2026 22:386,53461,648,17053,221,0001,017,0002,113,536