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 24, 2026 19:26Daniel MastalerzDaniel MastalerzScore: 5,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:265,56967,825,44842,204,0004,019,0002,318,336
2Feb 24, 2026 19:255,58167,283,60542,298,0004,028,0002,310,144
3Feb 24, 2026 19:265,59272,851,80642,376,0004,035,0002,326,528
4Feb 24, 2026 19:265,59369,556,01643,397,0003,027,0002,514,944
5Feb 24, 2026 19:255,64369,282,20242,849,0003,985,0002,273,280
6Feb 24, 2026 19:255,64573,400,74242,864,0003,987,0002,269,184
7Feb 24, 2026 19:265,67669,624,25244,102,0003,006,0002,260,992
8Feb 24, 2026 19:265,71870,255,01144,427,0003,029,0002,355,200
9Feb 24, 2026 19:265,72070,855,23744,446,0003,030,0002,306,048