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 listJun 30, 2026 09:32Victor MerckléVictor MerckléScore: 4,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 09:344,25243,121,31834,194,0001,105,0002,117,632stderr
2Jun 30, 2026 09:344,25343,138,73934,212,0001,094,0002,117,632stderr
3Jun 30, 2026 09:344,26043,147,41134,255,0001,106,0002,117,632stderr
4Jun 30, 2026 09:344,26743,214,41834,295,0001,129,0002,117,632stderr
5Jun 30, 2026 09:344,27443,321,60734,449,0001,029,0002,117,632stderr
6Jun 30, 2026 09:344,27743,478,79434,485,0001,021,0002,117,632stderr
7Jun 30, 2026 09:344,29543,351,00934,623,0001,031,0002,117,632stderr
8Jun 30, 2026 09:344,39444,348,26235,445,0001,030,0002,117,632stderr
9Jun 30, 2026 09:344,48052,640,63036,068,0001,121,0002,117,632stderr