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 10, 2026 19:39Daniel MastalerzDaniel MastalerzScore: 8,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:398,41196,569,92068,800,0001,011,0002,326,528
2Feb 10, 2026 19:398,42994,646,10567,964,0001,998,0002,310,144
3Feb 10, 2026 19:398,44696,258,01766,099,0004,006,0002,265,088
4Feb 10, 2026 19:398,59993,791,47868,354,0003,015,0002,310,144
5Feb 10, 2026 19:398,60195,747,98668,375,0003,016,0002,281,472
6Feb 10, 2026 19:398,662102,778,09867,902,0003,994,0002,322,432