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 19, 2026 21:50Mikołaj UzarskiMikołaj UzarskiScore: 5,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:505,83974,278,85841,395,0007,067,0002,383,872
2Feb 19, 2026 21:505,85776,162,17641,526,0007,089,0002,396,160
3Feb 19, 2026 21:505,89270,772,02140,923,0007,984,0002,469,888