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 listJul 9, 2026 16:42Victor MerckléVictor MerckléScore: 18,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 16:4418,062159,908,812148,901,0001,019,0002,117,632stderr
2Jul 9, 2026 16:4418,062157,832,017148,833,0001,089,0002,117,632stderr
3Jul 9, 2026 16:4418,096158,081,155149,127,0001,076,0002,117,632stderr
4Jul 9, 2026 16:4418,118158,325,197149,285,0001,101,0002,117,632stderr
5Jul 9, 2026 16:4418,179158,855,488149,780,0001,111,0002,117,632stderr
6Jul 9, 2026 16:4418,191158,932,204149,937,0001,052,0002,117,632stderr
7Jul 9, 2026 16:4418,302159,790,792150,789,0001,120,0002,117,632stderr
8Jul 9, 2026 16:4418,310159,926,319150,971,0001,005,0002,117,632stderr
9Jul 9, 2026 16:4418,316159,931,203150,999,0001,031,0002,117,632stderr