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 16, 2025 01:03emily graceemily graceScore: 146,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 01:03145,97885,285,69353,012,0001,000,0002,289,664
2Apr 16, 2025 01:03146,16576,057,44552,078,0002,003,0002,273,280
3Apr 16, 2025 01:03146,25483,063,94852,110,0002,004,0002,289,664