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 09:08Valentin KofmanValentin KofmanScore: 4,284,811Success
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 09:084,283,2411,616,172,5691,583,800,000999,0002,514,944
2Jul 15, 2025 09:084,284,8111,610,608,8351,584,381,000999,0002,273,280
3Jul 15, 2025 09:084,293,2971,615,974,1271,587,521,000999,0002,273,280