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 listFeb 18, 2026 19:40Mikołaj UzarskiMikołaj UzarskiScore: 5,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:405,78172,206,32943,987,0003,998,0002,293,760
2Feb 18, 2026 19:405,79372,848,68443,075,0005,008,0002,433,024
3Feb 18, 2026 19:405,80478,396,87342,151,0006,021,0002,514,944