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 19:20Victor MerckléVictor MerckléScore: 14,063Success
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 19:2113,983123,947,702114,952,0001,114,0002,117,632stderr
2Jul 9, 2026 19:2114,034124,561,760115,479,0001,007,0002,117,632stderr
3Jul 9, 2026 19:2114,035124,487,392115,457,0001,035,0002,117,632stderr
4Jul 9, 2026 19:2114,036124,568,533115,371,0001,130,0002,117,632stderr
5Jul 9, 2026 19:2114,063124,849,087115,701,0001,023,0002,117,632stderr
6Jul 9, 2026 19:2114,065124,629,135115,723,0001,023,0002,117,632stderr
7Jul 9, 2026 19:2114,070124,759,838115,646,0001,137,0002,117,632stderr
8Jul 9, 2026 19:2114,104124,952,571115,906,0001,165,0002,117,632stderr
9Jul 9, 2026 19:2114,113125,079,910116,138,0001,008,0002,117,632stderr