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 23:10Victor MerckléVictor MerckléScore: 3,860Success
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 23:113,82840,206,12330,693,0001,084,0002,117,632stderr
2Aug 11, 2026 23:113,85640,249,35230,973,0001,037,0002,117,632stderr
3Aug 11, 2026 23:113,85740,388,98730,970,0001,049,0002,117,632stderr
4Aug 11, 2026 23:113,85940,442,53330,997,0001,033,0002,117,632stderr
5Aug 11, 2026 23:113,86042,287,85230,897,0001,145,0002,117,632stderr
6Aug 11, 2026 23:113,87240,549,72431,093,0001,047,0002,117,632stderr
7Aug 11, 2026 23:113,87540,608,31331,013,0001,156,0002,117,632stderr
8Aug 11, 2026 23:113,88040,684,06031,194,0001,018,0002,117,632stderr
9Aug 11, 2026 23:114,00541,687,60732,061,0001,183,0002,117,632stderr