TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJan 29, 2024 15:55AnSaAnSaScore: 73,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:5572,80350,450,90924,942,0001,995,0002,486,272
2Jan 29, 2024 15:5572,88452,906,39722,972,0003,995,0002,265,088
3Jan 29, 2024 15:5572,91454,223,95523,981,0002,997,0002,482,176
4Jan 29, 2024 15:5572,94149,519,99023,990,0002,998,0002,269,184
5Jan 29, 2024 15:5573,03248,746,09324,020,0003,002,0002,523,136
6Jan 29, 2024 15:5573,04654,065,62425,025,0002,002,0002,273,280
7Jan 29, 2024 15:5573,26849,484,32424,097,0003,012,0002,494,464
8Jan 29, 2024 15:5573,30850,626,07925,115,0002,009,0002,273,280
9Jan 29, 2024 15:5573,32449,913,49622,106,0005,024,0002,486,272
10Jan 29, 2024 15:5577,68199,052,25428,741,88602,232,320
11Jan 29, 2024 15:5577,79883,627,50628,785,13102,211,840
12Jan 29, 2024 15:5577,868112,852,54428,811,01702,211,840