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 25, 2026 19:29Daniel MastalerzDaniel MastalerzScore: 5,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 19:295,39569,471,86240,795,0003,980,0002,326,528
2Feb 25, 2026 19:295,39571,904,09542,786,0001,990,0002,265,088
3Feb 25, 2026 19:295,39871,082,72040,821,0003,982,0002,326,528
4Feb 25, 2026 19:295,45272,220,09841,232,0004,022,0002,306,048
5Feb 25, 2026 19:295,48673,276,63842,497,0003,035,0002,265,088
6Feb 25, 2026 19:295,49777,548,38342,583,0003,041,0002,506,752