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 05:06Victor MerckléVictor MerckléScore: 4,935Success
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 05:074,90148,331,80939,599,0001,085,0002,113,536
2Jun 24, 2026 05:074,90848,371,34439,676,0001,067,0002,113,536
3Jun 24, 2026 05:074,92048,491,68039,749,0001,091,0002,113,536
4Jun 24, 2026 05:074,93348,579,50939,941,0001,006,0002,113,536
5Jun 24, 2026 05:074,93548,864,89039,864,0001,100,0002,113,536
6Jun 24, 2026 05:074,93648,617,52439,970,0001,005,0002,113,536
7Jun 24, 2026 05:074,93948,659,22139,913,0001,082,0002,113,536
8Jun 24, 2026 05:075,10149,984,21641,271,0001,073,0002,113,536
9Jun 24, 2026 05:075,14250,487,13641,597,0001,084,0002,113,536