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 10, 2026 16:28Victor MerckléVictor MerckléScore: 4,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:294,54345,657,55536,618,0001,090,0002,113,536
2Jun 10, 2026 16:294,55945,426,97936,786,0001,057,0002,113,536
3Jun 10, 2026 16:294,58445,646,50136,979,0001,074,0002,113,536
4Jun 10, 2026 16:294,63346,338,20637,375,0001,081,0002,113,536
5Jun 10, 2026 16:294,75047,003,73838,330,0001,097,0002,113,536
6Jun 10, 2026 16:294,75947,023,00438,404,0001,103,0002,113,536
7Jun 10, 2026 16:294,76646,912,36738,494,0001,066,0002,113,536
8Jun 10, 2026 16:294,80147,441,30838,822,0001,031,0002,113,536
9Jun 10, 2026 16:294,86247,753,68739,343,0001,017,0002,113,536