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 25, 2026 15:51Victor MerckléVictor MerckléScore: 5,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:535,12750,554,59441,449,0001,109,0002,113,536
2Jun 25, 2026 15:535,12850,537,35141,465,0001,098,0002,113,536
3Jun 25, 2026 15:535,13150,461,08241,485,0001,110,0002,113,536
4Jun 25, 2026 15:535,14150,223,21441,606,0001,072,0002,113,536
5Jun 25, 2026 15:535,14350,662,02941,596,0001,091,0002,113,536
6Jun 25, 2026 15:535,14550,185,71541,587,0001,117,0002,113,536
7Jun 25, 2026 15:535,15750,425,52141,729,0001,080,0002,113,536
8Jun 25, 2026 15:535,21451,149,52042,187,0001,095,0002,113,536
9Jun 25, 2026 15:535,39752,405,94443,713,0001,086,0002,113,536