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 29, 2026 14:57Victor MerckléVictor MerckléScore: 4,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:594,20343,932,29233,786,0001,101,0002,117,632stderr
2Aug 29, 2026 14:594,20443,268,44533,798,0001,100,0002,117,632stderr
3Aug 29, 2026 14:594,20643,278,61733,814,0001,098,0002,117,632stderr
4Aug 29, 2026 14:594,21343,372,00833,867,0001,103,0002,117,632stderr
5Aug 29, 2026 14:594,21644,041,86233,876,0001,118,0002,117,632stderr
6Aug 29, 2026 14:594,21944,079,28933,934,0001,089,0002,117,632stderr
7Aug 29, 2026 14:594,22544,060,63433,971,0001,104,0002,117,632stderr
8Aug 29, 2026 14:594,23643,545,80233,937,0001,222,0002,117,632stderr
9Aug 29, 2026 14:594,24243,502,14134,057,0001,154,0002,117,632stderr