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 25, 2026 01:13Victor MerckléVictor MerckléScore: 3,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:133,86241,086,05430,941,0001,120,0002,117,632stderr
2Aug 25, 2026 01:133,88740,598,40531,155,0001,111,0002,117,632stderr
3Aug 25, 2026 01:133,89240,720,60131,228,0001,079,0002,117,632stderr
4Aug 25, 2026 01:133,90540,670,19631,330,0001,089,0002,117,632stderr
5Aug 25, 2026 01:133,90740,799,37531,368,0001,065,0002,117,632stderr
6Aug 25, 2026 01:133,90840,912,37631,330,0001,112,0002,117,632stderr
7Aug 25, 2026 01:133,92240,937,61331,438,0001,115,0002,117,632stderr
8Aug 25, 2026 01:133,92640,962,46331,478,0001,111,0002,117,632stderr
9Aug 25, 2026 01:133,97441,332,48131,877,0001,115,0002,117,632stderr