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 listDec 22, 2025 04:17Josu San MartinJosu San MartinScore: 37,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 04:1737,230332,217,500308,010,0001,000,0002,273,280
2Dec 22, 2025 04:1737,231330,057,873307,019,0002,000,0002,400,256
3Dec 22, 2025 04:1737,235335,913,677307,047,0002,000,0002,387,968
4Dec 22, 2025 04:1737,240330,514,262308,089,0001,000,0002,277,376
5Dec 22, 2025 04:1737,242340,902,926307,106,0002,000,0002,289,664
6Dec 22, 2025 04:1737,245335,631,256307,137,0002,000,0002,273,280
7Dec 22, 2025 04:1737,252335,426,023307,188,0002,001,0002,273,280
8Dec 22, 2025 04:1737,254347,350,856307,206,0002,001,0002,289,664
9Dec 22, 2025 04:1737,259338,701,184307,247,0002,001,0002,289,664