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 listJul 15, 2025 18:49Valentin KofmanValentin KofmanScore: 63,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 18:4963,19545,766,18922,366,0001,016,0002,260,992
2Jul 15, 2025 18:4963,26247,526,23822,390,0001,017,0002,269,184
3Jul 15, 2025 18:4963,33849,559,17223,435,00002,265,088
4Jul 15, 2025 18:4963,35951,748,48122,424,0001,019,0002,392,064
5Jul 15, 2025 18:4963,37345,397,32722,429,0001,019,0002,396,160
6Jul 15, 2025 18:4963,53844,370,69822,487,0001,022,0002,392,064
7Jul 15, 2025 18:4963,63843,533,79422,523,0001,023,0002,404,352
8Jul 15, 2025 18:4963,64646,937,61323,549,00002,396,160
9Jul 15, 2025 18:4963,75755,636,76023,590,00002,269,184