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,812Success
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,646101,457,07968,775,0002,990,0002,326,528
2Feb 10, 2026 19:398,65397,592,69568,826,0002,992,0002,318,336
3Feb 10, 2026 19:398,66398,601,01967,911,0003,994,0002,265,088
4Feb 10, 2026 19:398,81294,428,00470,131,0003,005,0002,285,568
5Feb 10, 2026 19:398,82297,429,97571,219,0002,006,0002,322,432
6Feb 10, 2026 19:398,82398,194,27469,223,0004,012,0002,289,664