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 7, 2026 13:47TonyTonyScore: 7,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 13:477,62171,576,26961,135,0002,126,0002,117,632
2Aug 7, 2026 13:477,62971,552,57561,188,0002,138,0002,117,632
3Aug 7, 2026 13:477,63171,788,14261,198,0002,145,0002,117,632
4Aug 7, 2026 13:477,63271,755,33561,232,0002,121,0002,117,632
5Aug 7, 2026 13:477,63571,599,70561,224,0002,152,0002,117,632
6Aug 7, 2026 13:477,64471,903,80661,325,0002,128,0002,117,632
7Aug 7, 2026 13:477,66371,783,47761,573,0002,037,0002,117,632
8Aug 7, 2026 13:477,66571,851,98861,481,0002,144,0002,117,632
9Aug 7, 2026 13:477,68871,971,25261,676,0002,135,0002,117,632