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 21:10Victor MerckléVictor MerckléScore: 7,790Success
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 21:117,73671,984,04063,100,0001,112,0002,117,632stderr
2Jun 25, 2026 21:117,73971,991,33563,108,0001,128,0002,117,632stderr
3Jun 25, 2026 21:117,74171,983,97363,120,0001,137,0002,117,632stderr
4Jun 25, 2026 21:117,76172,127,72563,304,0001,115,0002,117,632stderr
5Jun 25, 2026 21:117,79072,422,13163,538,0001,127,0002,117,632stderr
6Jun 25, 2026 21:117,84172,792,78163,951,0001,134,0002,117,632stderr
7Jun 25, 2026 21:117,84972,838,98464,097,0001,057,0002,117,632stderr
8Jun 25, 2026 21:117,90873,452,81464,506,0001,134,0002,117,632stderr
9Jun 25, 2026 21:117,92673,533,98564,756,0001,033,0002,117,632stderr