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 23, 2026 15:03Victor MerckléVictor MerckléScore: 22,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 15:0422,040190,375,265181,863,0001,074,0002,113,536
2Jun 23, 2026 15:0422,048190,613,316181,932,0001,073,0002,113,536
3Jun 23, 2026 15:0422,054190,537,152181,966,0001,083,0002,113,536
4Jun 23, 2026 15:0422,055190,607,393181,949,0001,110,0002,113,536
5Jun 23, 2026 15:0422,059190,756,161182,001,0001,094,0002,113,536
6Jun 23, 2026 15:0422,063190,942,755182,058,0001,072,0002,113,536
7Jun 23, 2026 15:0422,066190,703,765182,141,0001,012,0002,113,536
8Jun 23, 2026 15:0422,083190,887,220182,215,0001,076,0002,113,536
9Jun 23, 2026 15:0422,100191,507,567182,344,0001,094,0002,113,536