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 21:29Valentin KofmanValentin KofmanScore: 69,416Success
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 21:2969,35952,445,82524,637,0001,026,0002,396,160
2Jul 15, 2025 21:2969,41654,686,85525,684,00002,396,160
3Jul 15, 2025 21:2969,83556,558,82124,846,000993,0002,400,256