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 24, 2026 21:14Victor MerckléVictor MerckléScore: 4,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 21:154,47644,806,14836,044,0001,112,0002,113,536
2Jun 24, 2026 21:154,48444,802,27236,112,0001,106,0002,113,536
3Jun 24, 2026 21:154,48545,216,18136,143,0001,084,0002,113,536
4Jun 24, 2026 21:154,48845,155,80236,162,0001,091,0002,113,536
5Jun 24, 2026 21:154,48844,873,26436,162,0001,096,0002,113,536
6Jun 24, 2026 21:154,49146,136,50636,162,0001,119,0002,113,536
7Jun 24, 2026 21:154,53545,256,91136,576,0001,069,0002,113,536
8Jun 24, 2026 21:154,54245,363,41736,595,0001,105,0002,113,536
9Jun 24, 2026 21:154,63146,271,59237,425,0001,019,0002,113,536