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 12, 2026 16:05Victor MerckléVictor MerckléScore: 3,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 16:063,79942,175,87330,441,0001,093,0002,117,632stderr
2Aug 12, 2026 16:063,81440,165,01430,539,0001,119,0002,117,632stderr
3Aug 12, 2026 16:063,82840,272,38830,647,0001,129,0002,117,632stderr
4Aug 12, 2026 16:063,84840,370,75730,841,0001,098,0002,117,632stderr
5Aug 12, 2026 16:063,86740,478,34331,041,0001,059,0002,117,632stderr
6Aug 12, 2026 16:063,86840,522,96131,019,0001,093,0002,117,632stderr
7Aug 12, 2026 16:063,88540,664,94631,159,0001,087,0002,117,632stderr
8Aug 12, 2026 16:063,97242,052,80531,914,0001,057,0002,117,632stderr
9Aug 12, 2026 16:064,02641,820,09432,347,0001,075,0002,117,632stderr