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 listNov 3, 2026 05:46Andrew EpsteinAndrew EpsteinScore: 9,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 05:469,91691,591,31482,308,000024,576stderr
2Nov 3, 2026 05:469,94791,765,56481,467,0001,098,0002,117,632stderr
3Nov 3, 2026 05:469,97292,050,22782,769,000024,576stderr
4Nov 3, 2026 05:469,98392,189,33481,856,0001,007,00024,576stderr
5Nov 3, 2026 05:469,98892,618,74281,768,0001,138,0002,117,632stderr
6Nov 3, 2026 05:4610,00492,591,31981,959,0001,080,0002,117,632stderr
7Nov 3, 2026 05:4610,02692,821,86482,214,0001,006,00024,576stderr
8Nov 3, 2026 05:4610,05192,661,41982,418,0001,008,0002,117,632stderr
9Nov 3, 2026 05:4610,12593,261,11183,032,0001,009,0002,117,632stderr