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 27, 2026 02:01Victor MerckléVictor MerckléScore: 3,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:013,73139,119,47929,842,0001,130,0002,113,536
2Aug 27, 2026 02:013,75239,496,93930,064,0001,085,0002,113,536
3Aug 27, 2026 02:013,76139,444,14430,131,0001,090,0002,113,536
4Aug 27, 2026 02:013,77639,581,41630,150,0001,191,0002,113,536
5Aug 27, 2026 02:013,82140,825,00730,559,0001,163,0002,113,536
6Aug 27, 2026 02:013,82840,092,93330,650,0001,130,0002,113,536
7Aug 27, 2026 02:013,90140,718,44231,364,0001,019,0002,113,536
8Aug 27, 2026 02:013,97341,300,69431,907,0001,075,0002,113,536
9Aug 27, 2026 02:014,04650,229,38732,471,0001,112,0002,113,536