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 10:43Daniel MastalerzDaniel MastalerzScore: 6,885Success
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 10:436,79978,939,54452,401,0004,030,0002,293,760
2Feb 21, 2026 10:436,82088,677,53555,600,0001,010,0002,269,184
3Feb 21, 2026 10:436,84281,953,41351,806,0004,981,0002,330,624
4Feb 21, 2026 10:436,88580,179,13153,132,0004,010,0002,301,952
5Feb 21, 2026 10:436,93281,567,76656,529,0001,009,0002,260,992
6Feb 21, 2026 10:437,05180,798,80455,494,0003,026,0002,322,432