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 14, 2026 09:00Daniel MastalerzDaniel MastalerzScore: 10,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 09:0010,172107,801,65681,410,0003,015,0002,277,376
2Feb 14, 2026 09:0010,176112,201,38281,448,0003,016,0002,326,528
3Feb 14, 2026 09:0010,182104,849,50282,497,0002,012,0002,326,528
4Feb 14, 2026 09:0010,387108,780,70284,211,0002,005,0002,318,336
5Feb 14, 2026 09:0010,388107,478,28083,217,0003,007,0002,318,336
6Feb 14, 2026 09:0010,392109,061,38282,244,0004,011,0002,523,136