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:13SneedSneedScore: 68,188Success
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:1368,162590,874,526502,774,00062,971,0002,281,472
2Feb 22, 2026 14:1368,188595,256,148501,965,00063,995,0002,289,664
3Feb 22, 2026 14:1368,196590,894,244501,027,00065,003,0002,265,088