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 24, 2026 23:10Victor MerckléVictor MerckléScore: 3,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 23:113,85240,380,10230,863,0001,112,0002,117,632stderr
2Aug 24, 2026 23:113,87040,510,60430,997,0001,130,0002,117,632stderr
3Aug 24, 2026 23:113,87340,569,79930,998,0001,152,0002,117,632stderr
4Aug 24, 2026 23:113,89640,728,54931,251,0001,092,0002,117,632stderr
5Aug 24, 2026 23:113,90340,769,92431,294,0001,108,0002,117,632stderr
6Aug 24, 2026 23:113,92340,925,69931,478,0001,085,0002,117,632stderr
7Aug 24, 2026 23:113,94841,142,65831,686,0001,090,0002,117,632stderr
8Aug 24, 2026 23:114,08342,251,95232,787,0001,103,0002,117,632stderr
9Aug 24, 2026 23:114,08442,309,85532,845,0001,060,0002,117,632stderr