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 17:08Victor MerckléVictor MerckléScore: 4,797Success
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 17:094,74147,620,38638,340,0001,018,0002,117,632stderr
2Aug 10, 2026 17:094,76147,942,18438,422,0001,098,0002,117,632stderr
3Aug 10, 2026 17:094,76447,773,52538,542,0001,006,0002,117,632stderr
4Aug 10, 2026 17:094,77247,730,87638,504,0001,107,0002,117,632stderr
5Aug 10, 2026 17:094,79748,002,38638,707,0001,113,0002,117,632stderr
6Aug 10, 2026 17:094,84748,418,69139,230,0001,006,0002,117,632stderr
7Aug 10, 2026 17:094,87049,084,22339,352,0001,077,0002,117,632stderr
8Aug 10, 2026 17:094,88348,651,36739,511,0001,024,0002,117,632stderr
9Aug 10, 2026 17:0964,696545,150,160535,958,0001,022,0002,117,632stderr