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 11, 2026 16:40Daniel MastalerzDaniel MastalerzScore: 10,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 16:4010,144108,739,27080,184,0004,009,0002,265,088
2Feb 11, 2026 16:4010,146108,028,32780,204,0004,010,0002,265,088
3Feb 11, 2026 16:4010,153106,279,17081,257,0003,009,0002,375,680
4Feb 11, 2026 16:4010,343107,703,81382,849,0002,994,0002,310,144
5Feb 11, 2026 16:4010,361106,989,88081,999,0003,999,0002,281,472
6Feb 11, 2026 16:4010,374113,236,98183,103,0003,003,0002,273,280