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 18, 2025 11:37AlexAlexScore: 44,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2025 11:3743,840387,016,136361,872,0001,999,0002,277,376
2Feb 18, 2025 11:3744,922398,090,474368,855,0003,998,0002,277,376
3Feb 18, 2025 11:3744,931396,288,801371,928,000999,0002,379,776
4Feb 18, 2025 11:3744,931398,762,139369,932,0002,999,0002,277,376
5Feb 18, 2025 11:3744,931397,784,166370,932,0001,999,0002,277,376
6Feb 18, 2025 11:3744,935400,132,336369,961,0002,999,0002,277,376
7Feb 18, 2025 11:3744,942395,416,629370,020,0003,000,0002,277,376
8Feb 18, 2025 11:3744,964395,470,248370,199,0003,001,0002,269,184
9Feb 18, 2025 11:3744,966395,995,809370,215,0003,001,0002,277,376