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 listMay 16, 2026 06:53Victor MerckléVictor MerckléScore: 7,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 06:557,13967,504,55359,255,00002,113,536
2May 16, 2026 06:557,28370,608,90960,454,00002,113,536
3May 16, 2026 06:557,35968,345,32960,051,0001,032,0002,113,536
4May 16, 2026 06:557,85874,663,98065,223,00002,113,536
5May 16, 2026 06:557,86075,637,22264,236,0001,007,0002,113,536
6May 16, 2026 06:557,86673,250,89364,271,0001,019,0002,113,536
7May 16, 2026 06:557,88775,656,08964,425,0001,039,0002,113,536
8May 16, 2026 06:557,89777,246,14064,498,0001,053,0002,113,536
9May 16, 2026 06:557,98575,577,41765,243,0001,039,0002,113,536