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 23, 2026 14:53Victor MerckléVictor MerckléScore: 11,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 14:5411,667104,616,07795,752,0001,088,0002,113,536
2Jun 23, 2026 14:5411,668104,341,32395,751,0001,096,0002,113,536
3Jun 23, 2026 14:5411,668104,353,51395,784,0001,064,0002,113,536
4Jun 23, 2026 14:5411,669104,454,89495,789,0001,064,0002,113,536
5Jun 23, 2026 14:5411,672105,013,94595,797,0001,081,0002,113,536
6Jun 23, 2026 14:5411,676105,150,08695,824,0001,090,0002,113,536
7Jun 23, 2026 14:5411,678104,414,99895,859,0001,072,0002,113,536
8Jun 23, 2026 14:5411,830106,131,72397,138,0001,058,0002,113,536
9Jun 23, 2026 14:5412,094108,251,11499,266,0001,116,0002,113,536