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 21, 2026 13:16Daniel MastalerzDaniel MastalerzScore: 5,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 13:165,73073,389,42845,536,0002,023,0002,326,528
2Feb 21, 2026 13:165,74274,775,77846,646,0001,014,0002,306,048
3Feb 21, 2026 13:165,80271,384,36544,144,0004,013,0002,326,528
4Feb 21, 2026 13:165,81072,969,91445,212,0003,014,0002,519,040
5Feb 21, 2026 13:165,84875,478,69246,514,0002,022,0002,260,992
6Feb 21, 2026 13:165,85871,572,29046,599,0002,026,0002,310,144