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 22:40Victor MerckléVictor MerckléScore: 5,106Success
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 22:415,06750,271,48541,039,0001,022,0002,117,632stderr
2Aug 25, 2026 22:415,09050,610,34441,242,0001,011,0002,117,632stderr
3Aug 25, 2026 22:415,09350,626,11141,269,0001,008,0002,117,632stderr
4Aug 25, 2026 22:415,10450,797,77041,307,0001,063,0002,117,632stderr
5Aug 25, 2026 22:415,10650,724,76841,349,0001,031,0002,117,632stderr
6Aug 25, 2026 22:415,14651,079,68841,684,0001,036,0002,117,632stderr
7Aug 25, 2026 22:415,15351,457,84841,736,0001,039,0002,117,632stderr
8Aug 25, 2026 22:415,21051,625,97842,216,0001,030,0002,117,632stderr
9Aug 25, 2026 22:415,27152,163,53142,726,0001,031,0002,117,632stderr