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:27Mikołaj UzarskiMikołaj UzarskiScore: 5,953Success
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:275,82770,206,76541,310,0007,052,0002,424,832
2Feb 19, 2026 21:275,95378,476,66843,363,0006,050,0002,445,312
3Feb 19, 2026 21:275,97884,777,81045,566,0004,050,0002,510,848