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 22, 2026 14:28SneedSneedScore: 80,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 14:2880,371690,450,566630,077,00037,004,0002,289,664
2Feb 22, 2026 14:2880,427699,336,908608,584,00058,959,0002,469,888
3Feb 22, 2026 14:2880,547701,115,492629,565,00038,973,0002,482,176