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 11, 2026 04:44Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 04:45039,762,61131,069,0001,064,0002,113,536expected "53689226091822246 ", got "53689228167783271 "
2May 11, 2026 04:45042,153,69231,060,0001,079,0002,113,536expected "53691792727430607 ", got "53691792685150928 "
3May 11, 2026 04:45040,235,49931,418,0001,065,0002,113,536expected "53691087038218972 ", got "53691085857144396 "
4May 11, 2026 04:453,85839,301,29430,929,0001,096,0002,113,536
5May 11, 2026 04:453,86439,683,75030,989,0001,086,0002,113,536
6May 11, 2026 04:453,87042,779,70531,037,0001,084,0002,113,536
7May 11, 2026 04:453,89141,653,91931,204,0001,097,0002,113,536
8May 11, 2026 04:453,90841,975,82231,352,0001,086,0002,113,536
9May 11, 2026 04:453,94041,785,74231,640,0001,066,0002,113,536