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 11, 2026 00:58Victor MerckléVictor MerckléScore: 15,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 00:5815,525136,440,607127,737,0001,128,0002,113,536
2Jun 11, 2026 00:5815,525136,487,751127,766,0001,097,0002,113,536
3Jun 11, 2026 00:5815,526136,464,698127,780,0001,094,0002,113,536
4Jun 11, 2026 00:5815,538136,622,290127,828,0001,144,0002,113,536
5Jun 11, 2026 00:5815,545136,653,785127,877,0001,152,0002,113,536
6Jun 11, 2026 00:5815,551136,767,716127,885,0001,192,0002,113,536
7Jun 11, 2026 00:5815,568137,187,233128,075,0001,145,0002,113,536
8Jun 11, 2026 00:5815,576136,932,519128,273,0001,013,0002,113,536
9Jun 11, 2026 00:5815,583137,069,868128,185,0001,156,0002,113,536