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 22, 2025 16:12Oleg KovalovOleg KovalovScore: 421,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 16:12419,573180,425,564101,158,00054,084,0002,289,664
2Jan 22, 2025 16:12420,508183,336,903108,410,00047,178,0002,277,376
3Jan 22, 2025 16:12421,059183,828,98098,868,00056,924,0002,289,664
4Jan 22, 2025 16:12421,059181,978,919122,836,00032,956,0002,289,664
5Jan 22, 2025 16:12421,565180,964,569110,985,00044,994,0002,289,664
6Jan 22, 2025 16:12422,259177,718,48497,147,00059,089,0002,265,088
7Jan 22, 2025 16:12422,270179,288,643100,154,00056,086,0002,523,136
8Jan 22, 2025 16:12423,727185,635,330103,854,00052,925,0002,289,664
9Jan 22, 2025 16:12427,973182,479,894103,228,00055,122,0002,269,184