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 04:24Andrew EpsteinAndrew EpsteinScore: 9,964Success
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 04:429,88391,878,70082,036,000024,576stderr
2Nov 3, 2026 04:429,89591,525,98981,041,0001,095,0002,117,632stderr
3Nov 3, 2026 04:429,94391,794,79982,534,000024,576stderr
4Nov 3, 2026 04:429,95091,862,45281,486,0001,105,0002,117,632stderr
5Nov 3, 2026 04:429,96491,938,49982,705,000024,576stderr
6Nov 3, 2026 04:429,97992,188,85881,730,0001,100,0002,117,632stderr
7Nov 3, 2026 04:429,98192,150,65082,849,000024,576stderr
8Nov 3, 2026 04:429,99992,242,67282,992,000024,576stderr
9Nov 3, 2026 04:4210,04392,627,02082,260,0001,099,0002,117,632stderr