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 listApr 11, 2025 20:49Yuriy LyfenkoYuriy LyfenkoScore: 59,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 20:4959,246541,032,52619,929,0001,992,0002,441,216
2Apr 11, 2025 20:4859,346550,699,67719,962,0001,996,0002,445,312
3Apr 11, 2025 20:4859,370543,697,81419,970,0001,997,0002,265,088
4Apr 11, 2025 20:4959,484555,217,38720,009,0002,000,0002,265,088
5Apr 11, 2025 20:4959,503546,115,05520,015,0002,001,0002,527,232
6Apr 11, 2025 20:4859,508548,715,55720,017,0002,001,0002,527,232