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 18:40Victor MerckléVictor MerckléScore: 12,850Success
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 18:4112,696112,991,058104,265,0001,118,0002,117,632stderr
2Jun 25, 2026 18:4112,714113,193,859104,423,0001,110,0002,117,632stderr
3Jun 25, 2026 18:4112,738113,809,016104,679,0001,052,0002,117,632stderr
4Jun 25, 2026 18:4112,829114,176,916105,354,0001,127,0002,117,632stderr
5Jun 25, 2026 18:4112,850114,188,632105,530,0001,125,0002,117,632stderr
6Jun 25, 2026 18:4112,882114,979,319105,811,0001,117,0002,117,632stderr
7Jun 25, 2026 18:4112,885114,805,772105,841,0001,109,0002,117,632stderr
8Jun 25, 2026 18:4112,899114,703,202105,963,0001,102,0002,117,632stderr
9Jun 25, 2026 18:4112,917114,880,728106,171,0001,041,0002,117,632stderr