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 16, 2026 09:16wnwnScore: 9,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 09:167,68786,464,64454,829,0008,972,0002,392,064
2Feb 16, 2026 09:167,80991,158,71055,839,0008,974,0002,473,984
3Feb 16, 2026 09:167,81590,323,30556,884,0007,983,0002,396,160
4Feb 16, 2026 09:169,01099,510,49068,804,0005,982,0002,441,216
5Feb 16, 2026 09:169,03797,261,85167,007,0008,000,0002,457,600
6Feb 16, 2026 09:169,05897,581,15766,161,0009,022,0002,461,696