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 listOct 23, 2025 19:19caandocaandoScore: 6,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 19:225,88671,854,05447,839,0001,017,0002,396,160
2Oct 23, 2025 19:045,88776,209,29148,861,00002,285,568
3Oct 23, 2025 19:045,88874,005,37246,873,0001,994,0002,523,136
4Oct 23, 2025 19:225,88977,056,30346,881,0001,994,0002,265,088
5Oct 23, 2025 19:195,89170,530,95147,895,000997,0002,523,136
6Oct 23, 2025 19:045,91272,954,30647,064,0002,002,0002,519,040
7Oct 23, 2025 19:225,92375,744,60347,157,0002,006,0002,273,280
8Oct 23, 2025 19:195,92771,536,46047,185,0002,007,0002,265,088
9Oct 23, 2025 19:195,95971,896,88248,451,0001,009,0002,277,376
10Oct 23, 2025 19:046,01572,633,30248,929,000998,0002,285,568
11Oct 23, 2025 19:046,01972,620,47547,958,0001,998,0002,265,088
12Oct 23, 2025 19:046,02582,113,69049,008,0001,000,0002,285,568
13Oct 23, 2025 19:196,02777,097,32948,023,0002,000,0002,265,088
14Oct 23, 2025 19:226,02978,080,02748,036,0002,001,0002,285,568
15Oct 23, 2025 19:226,03271,020,69848,061,0002,002,0002,285,568
16Oct 23, 2025 19:196,03673,333,29348,093,0002,003,0002,285,568
17Oct 23, 2025 19:196,03772,913,83649,102,0001,002,0002,523,136
18Oct 23, 2025 19:226,05073,376,67848,204,0002,008,0002,285,568