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 18:34Victor MerckléVictor MerckléScore: 3,859Success
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 18:363,84940,313,32130,907,0001,043,0002,117,632stderr
2Aug 11, 2026 18:363,85540,437,24430,849,0001,151,0002,117,632stderr
3Aug 11, 2026 18:363,85740,395,43930,990,0001,026,0002,117,632stderr
4Aug 11, 2026 18:363,85840,424,86630,983,0001,041,0002,117,632stderr
5Aug 11, 2026 18:363,85940,472,65030,905,0001,129,0002,117,632stderr
6Aug 11, 2026 18:363,87740,707,98431,042,0001,145,0002,117,632stderr
7Aug 11, 2026 18:363,90040,753,25331,338,0001,034,0002,117,632stderr
8Aug 11, 2026 18:363,94841,153,60631,621,0001,149,0002,117,632stderr
9Aug 11, 2026 18:364,08342,309,64932,844,0001,045,0002,117,632stderr