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 28, 2026 19:41Victor MerckléVictor MerckléScore: 5,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:415,09150,445,76741,226,0001,032,0002,117,632stderr
2Aug 28, 2026 19:415,11651,492,87741,435,0001,035,0002,117,632stderr
3Aug 28, 2026 19:415,15451,786,48641,757,0001,027,0002,117,632stderr
4Aug 28, 2026 19:415,16751,084,69541,865,0001,023,0002,117,632stderr
5Aug 28, 2026 19:415,17051,897,59541,894,0001,020,0002,117,632stderr
6Aug 28, 2026 19:415,17651,993,36141,936,0001,029,0002,117,632stderr
7Aug 28, 2026 19:415,17751,989,19141,951,0001,020,0002,117,632stderr
8Aug 28, 2026 19:415,18252,065,65741,993,0001,021,0002,117,632stderr
9Aug 28, 2026 19:415,18351,990,21842,008,0001,019,0002,117,632stderr