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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:3410,24694,170,59483,918,0001,126,0002,113,536
2May 24, 2026 11:3410,24693,563,21183,996,0001,048,0002,113,536
3May 24, 2026 11:3410,25293,131,92384,033,0001,062,0002,113,536
4May 24, 2026 11:3410,25392,924,23584,020,0001,088,0002,113,536
5May 24, 2026 11:3410,25392,877,33584,032,0001,072,0002,113,536
6May 24, 2026 11:3410,25593,320,94784,055,0001,067,0002,113,536
7May 24, 2026 11:3410,28793,275,67184,389,0001,001,0002,113,536
8May 24, 2026 11:3410,30194,910,86884,472,0001,030,0002,113,536
9May 24, 2026 11:3410,57998,570,93986,747,0001,065,0002,113,536