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 15, 2026 18:25Victor MerckléVictor MerckléScore: 6,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 18:256,95065,493,11656,650,0001,039,0002,113,536
2May 15, 2026 18:256,95169,372,01556,696,0001,002,0002,113,536
3May 15, 2026 18:256,95265,005,04156,692,0001,013,0002,113,536
4May 15, 2026 18:256,95367,356,89456,707,0001,004,0002,113,536
5May 15, 2026 18:256,95465,807,17557,723,00002,113,536
6May 15, 2026 18:256,95967,199,36056,751,0001,013,0002,113,536
7May 15, 2026 18:256,96065,919,65556,739,0001,035,0002,113,536
8May 15, 2026 18:257,00765,414,45658,160,00002,113,536
9May 15, 2026 18:257,03068,595,71357,285,0001,067,0002,113,536