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 listJan 24, 2023 20:12unsatcoreunsatcoreScore: 12,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2023 20:1211,545152,535,49895,826,69002,277,376
2Jan 24, 2023 20:1211,550160,934,32895,863,44102,273,280
3Jan 24, 2023 20:1211,563166,829,39295,976,36702,277,376
4Jan 24, 2023 20:1211,958123,460,29896,248,0003,007,0002,277,376
5Jan 24, 2023 20:1211,968123,615,72998,335,0001,003,0002,277,376
6Jan 24, 2023 20:1212,025126,714,51297,812,0001,996,0002,273,280
7Jan 24, 2023 20:1212,031121,870,64996,864,0002,995,0002,527,232
8Jan 24, 2023 20:1212,115126,413,97699,549,0001,005,0002,277,376
9Jan 24, 2023 20:1212,116129,916,33299,557,0001,005,0002,277,376
10Jan 24, 2023 20:1212,142126,588,13097,789,0002,993,0002,277,376
11Jan 24, 2023 20:1212,170128,799,16198,009,0003,000,0002,277,376
12Jan 24, 2023 20:1212,275122,710,060100,887,000998,0002,277,376