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:52Valentin KofmanValentin KofmanScore: 63,762Success
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:5263,52449,635,61123,504,00002,396,160
2Jul 15, 2025 18:5263,76248,991,83522,567,0001,025,0002,269,184
3Jul 15, 2025 18:5263,87357,634,51123,633,00002,269,184