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 listMay 14, 2026 21:14Victor MerckléVictor MerckléScore: 56,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 21:1456,816478,780,796470,569,0001,005,0002,117,632stderr
2May 14, 2026 21:1456,829480,492,196470,683,0001,004,0002,117,632stderr
3May 14, 2026 21:1456,833479,161,269470,710,0001,004,0002,117,632stderr
4May 14, 2026 21:1456,874479,779,896470,033,0002,023,0002,117,632stderr
5May 14, 2026 21:1456,874481,255,305471,057,0001,005,0002,117,632stderr
6May 14, 2026 21:1456,884480,014,294471,135,0001,005,0002,117,632stderr
7May 14, 2026 21:1456,893481,578,073471,213,0001,003,0002,117,632stderr
8May 14, 2026 21:1456,948480,042,479471,668,0001,005,0002,117,632stderr
9May 14, 2026 21:1456,990480,500,776472,014,0001,004,0002,117,632stderr