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 14, 2026 06:29Victor MerckléVictor MerckléScore: 6,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:296,97465,546,64956,849,0001,042,0002,113,536
2May 14, 2026 06:296,97867,515,06356,908,0001,015,0002,113,536
3May 14, 2026 06:296,98166,912,28057,948,00002,113,536
4May 14, 2026 06:296,98267,160,13957,955,00002,113,536
5May 14, 2026 06:296,98467,022,42856,931,0001,040,0002,113,536
6May 14, 2026 06:296,98466,213,25057,972,00002,113,536
7May 14, 2026 06:296,98567,610,59057,977,00002,113,536
8May 14, 2026 06:296,98768,201,14056,987,0001,009,0002,113,536
9May 14, 2026 06:297,08468,393,31257,770,0001,035,0002,113,536