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 11, 2026 11:53Victor MerckléVictor MerckléScore: 10,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 11:5310,65797,222,21387,208,0001,253,0002,113,536
2May 11, 2026 11:5310,65998,664,35287,201,0001,276,0002,113,536
3May 11, 2026 11:5310,66097,191,52787,230,0001,252,0002,113,536
4May 11, 2026 11:5310,66197,250,57587,246,0001,243,0002,113,536
5May 11, 2026 11:5310,66299,209,15787,235,0001,266,0002,113,536
6May 11, 2026 11:5310,66297,517,28987,234,0001,263,0002,113,536
7May 11, 2026 11:5310,66297,216,62687,237,0001,263,0002,113,536
8May 11, 2026 11:5310,66399,017,20687,250,0001,260,0002,113,536
9May 11, 2026 11:5310,66598,097,35987,252,0001,272,0002,113,536