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 1, 2026 13:26George SeabridgeGeorge SeabridgeScore: 8,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:277,21069,866,71358,765,0001,081,0002,113,536
2Aug 1, 2026 13:277,21369,816,45458,792,0001,077,0002,113,536
3Aug 1, 2026 13:277,21870,711,94158,835,0001,076,0002,113,536
4Aug 1, 2026 13:277,22069,969,90958,842,0001,089,0002,113,536
5Aug 1, 2026 13:278,10877,304,91966,172,0001,125,0002,113,536
6Aug 1, 2026 13:278,64381,762,09170,646,0001,097,0002,113,536
7Aug 1, 2026 13:278,68882,229,73370,901,0001,217,0002,113,536
8Aug 1, 2026 13:278,68983,790,42271,019,0001,105,0002,113,536
9Aug 1, 2026 13:278,75882,681,34771,603,0001,093,0002,113,536