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 10, 2026 17:02Victor MerckléVictor MerckléScore: 5,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:035,50854,119,83344,664,0001,056,0002,117,632stderr
2Aug 10, 2026 17:035,52354,938,00044,794,0001,051,0002,117,632stderr
3Aug 10, 2026 17:035,52954,213,10344,837,0001,058,0002,117,632stderr
4Aug 10, 2026 17:035,53454,350,88444,875,0001,063,0002,117,632stderr
5Aug 10, 2026 17:035,54655,117,74144,945,0001,088,0002,117,632stderr
6Aug 10, 2026 17:035,55254,473,03245,044,0001,038,0002,117,632stderr
7Aug 10, 2026 17:035,55754,603,61145,070,0001,061,0002,117,632stderr
8Aug 10, 2026 17:035,65255,251,25745,885,0001,029,0002,117,632stderr
9Aug 10, 2026 17:035,80456,541,32247,144,0001,033,0002,117,632stderr