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:36Daniel MastalerzDaniel MastalerzScore: 10,288Success
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:3610,086116,865,57179,731,0003,986,0002,310,144
2Feb 10, 2026 19:3610,094112,079,59081,785,0001,994,0002,326,528
3Feb 10, 2026 19:3610,095110,055,14581,795,0001,995,0002,326,528
4Feb 10, 2026 19:3610,288111,641,39881,374,0004,018,0002,514,944
5Feb 10, 2026 19:3610,301112,200,05483,487,0002,011,0002,306,048
6Feb 10, 2026 19:3610,310115,090,18083,556,0002,013,0002,277,376