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 listMar 1, 2026 22:46wnwnScore: 4,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 22:474,36359,625,00434,198,0002,011,0002,277,376
2Mar 1, 2026 22:464,36661,078,69934,228,0002,013,0002,498,560
3Mar 1, 2026 22:494,36863,581,22634,244,0002,014,0002,277,376
4Mar 1, 2026 22:484,38861,133,99535,412,0001,011,0002,498,560
5Mar 1, 2026 22:484,40460,433,20035,537,0001,015,0002,277,376
6Mar 1, 2026 22:494,40864,361,88135,573,0001,016,0002,502,656
7Mar 1, 2026 22:494,41062,823,41535,585,0001,016,0002,277,376
8Mar 1, 2026 22:464,41360,479,89735,614,0001,017,0002,277,376
9Mar 1, 2026 22:464,41564,890,80335,626,0001,017,0002,494,464
10Mar 1, 2026 22:474,49966,577,57136,330,0001,009,0002,277,376
11Mar 1, 2026 22:474,71563,616,61136,124,0003,010,0002,486,272
12Mar 1, 2026 22:484,99366,696,48440,429,0001,010,0002,498,560