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:26Valentin KofmanValentin KofmanScore: 64,835Success
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:2664,77849,238,80922,970,000998,0002,400,256
2Jul 15, 2025 21:2664,83545,959,96621,990,0001,999,0002,269,184
3Jul 15, 2025 21:2665,01147,128,00122,050,0002,004,0002,392,064