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 25, 2026 12:43Victor MerckléVictor MerckléScore: 12,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 12:4412,242109,221,874100,518,0001,093,0002,113,536
2Jun 25, 2026 12:4412,244109,146,111100,559,0001,068,0002,113,536
3Jun 25, 2026 12:4412,250109,197,138100,574,0001,102,0002,113,536
4Jun 25, 2026 12:4412,250109,199,355100,579,0001,096,0002,113,536
5Jun 25, 2026 12:4412,253109,281,859100,598,0001,108,0002,113,536
6Jun 25, 2026 12:4412,256109,292,261100,638,0001,090,0002,113,536
7Jun 25, 2026 12:4412,261109,244,089100,714,0001,058,0002,113,536
8Jun 25, 2026 12:4412,277109,392,513100,823,0001,081,0002,113,536
9Jun 25, 2026 12:4412,333109,955,935101,353,0001,012,0002,113,536