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 listAug 15, 2026 12:55Tomislav TunkovicTomislav TunkovicScore: 4,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:554,62446,890,86338,386,000020,480
2Aug 15, 2026 12:554,63146,914,26038,441,000020,480
3Aug 15, 2026 12:554,63146,989,69338,439,000020,480
4Aug 15, 2026 12:554,63246,919,71538,452,000020,480
5Aug 15, 2026 12:554,63346,891,72138,456,000020,480
6Aug 15, 2026 12:554,63446,943,92438,465,000020,480
7Aug 15, 2026 12:554,64246,999,16238,531,000020,480
8Aug 15, 2026 12:554,68748,017,48638,906,000020,480
9Aug 15, 2026 12:554,72047,635,64839,177,000020,480