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 17:44Victor MerckléVictor MerckléScore: 5,299Success
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 17:455,27552,158,45542,761,0001,026,0002,117,632stderr
2Aug 11, 2026 17:455,28152,117,68542,721,0001,114,0002,117,632stderr
3Aug 11, 2026 17:455,29652,363,61942,893,0001,067,0002,117,632stderr
4Aug 11, 2026 17:455,29752,363,05142,926,0001,045,0002,117,632stderr
5Aug 11, 2026 17:455,29952,146,38342,941,0001,044,0002,117,632stderr
6Aug 11, 2026 17:455,30552,405,96443,017,0001,020,0002,117,632stderr
7Aug 11, 2026 17:455,32952,690,07343,094,0001,138,0002,117,632stderr
8Aug 11, 2026 17:455,44153,623,19244,157,0001,010,0002,117,632stderr
9Aug 11, 2026 17:455,59954,895,96445,435,0001,042,0002,117,632stderr