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 8, 2026 19:59Victor MerckléVictor MerckléScore: 4,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 20:004,56545,579,97836,846,0001,051,0002,113,536
2Jun 8, 2026 20:004,56845,629,08636,863,0001,056,0002,113,536
3Jun 8, 2026 20:004,57245,606,73336,893,0001,061,0002,113,536
4Jun 8, 2026 20:004,59645,818,89837,147,0001,008,0002,113,536
5Jun 8, 2026 20:004,60645,948,97037,165,0001,066,0002,113,536
6Jun 8, 2026 20:004,81647,429,83438,976,0001,004,0002,113,536
7Jun 8, 2026 20:004,82147,692,10739,013,0001,006,0002,113,536
8Jun 8, 2026 20:004,82149,051,66838,999,0001,018,0002,113,536
9Jun 8, 2026 20:004,84447,926,24039,127,0001,086,0002,113,536