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 09:46Victor MerckléVictor MerckléScore: 5,743Success
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 09:475,72855,887,79146,501,0001,042,0002,117,632stderr
2Aug 10, 2026 09:475,73256,664,49946,549,0001,034,0002,117,632stderr
3Aug 10, 2026 09:475,73755,931,37446,591,0001,027,0002,117,632stderr
4Aug 10, 2026 09:475,74055,815,25446,625,0001,021,0002,117,632stderr
5Aug 10, 2026 09:475,74357,152,90046,635,0001,039,0002,117,632stderr
6Aug 10, 2026 09:475,74555,966,97546,662,0001,028,0002,117,632stderr
7Aug 10, 2026 09:475,75056,064,45846,709,0001,024,0002,117,632stderr
8Aug 10, 2026 09:475,75855,939,60246,755,0001,039,0002,117,632stderr
9Aug 10, 2026 09:475,76056,010,13246,769,0001,039,0002,117,632stderr