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 11, 2026 11:44Victor MerckléVictor MerckléScore: 3,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:453,87440,450,63531,030,0001,131,0002,117,632stderr
2Aug 11, 2026 11:453,88940,526,84531,177,0001,109,0002,117,632stderr
3Aug 11, 2026 11:453,89240,603,14431,153,0001,157,0002,117,632stderr
4Aug 11, 2026 11:453,89340,683,36531,176,0001,143,0002,117,632stderr
5Aug 11, 2026 11:453,89841,813,02431,219,0001,137,0002,117,632stderr
6Aug 11, 2026 11:453,90940,763,70531,309,0001,143,0002,117,632stderr
7Aug 11, 2026 11:453,91140,759,43931,337,0001,132,0002,117,632stderr
8Aug 11, 2026 11:453,91740,806,36531,301,0001,211,0002,117,632stderr
9Aug 11, 2026 11:453,92740,791,30931,489,0001,107,0002,117,632stderr