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 listSep 17, 2026 00:58Andrew EpsteinAndrew EpsteinScore: 3,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:583,48239,092,58927,803,0001,102,0002,113,536
2Sep 17, 2026 00:583,48739,060,21827,836,0001,107,0002,113,536
3Sep 17, 2026 00:583,49239,106,29627,872,0001,116,0002,113,536
4Sep 17, 2026 00:583,49339,206,50827,890,0001,102,0002,113,536
5Sep 17, 2026 00:583,49939,127,47727,931,0001,111,0002,113,536
6Sep 17, 2026 00:583,50039,251,14527,956,0001,097,0002,113,536
7Sep 17, 2026 00:583,51839,348,01128,096,0001,110,0002,113,536
8Sep 17, 2026 00:583,53739,538,09628,228,0001,137,0002,113,536
9Sep 17, 2026 00:583,65040,434,58029,210,0001,092,0002,113,536