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 7, 2026 15:04Daniel MastalerzDaniel MastalerzScore: 13,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 15:0413,612139,758,725110,980,0001,999,0002,277,376
2Feb 7, 2026 15:0413,620135,364,426111,043,0002,000,0002,277,376
3Feb 7, 2026 15:0413,624135,759,154112,083,0001,000,0002,277,376
4Feb 7, 2026 15:0413,631137,812,403111,135,0002,002,0002,277,376
5Feb 7, 2026 15:0413,684140,340,602113,576,00002,277,376
6Feb 7, 2026 15:0413,703143,736,266112,740,000997,0002,277,376
7Feb 7, 2026 15:0413,705141,013,251111,759,0001,995,0002,277,376
8Feb 7, 2026 15:0413,705139,352,240113,752,00002,277,376
9Feb 7, 2026 15:0413,706142,129,361111,761,0001,995,0002,273,280