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 22:29Drew GarciaDrew GarciaScore: 100,719Success
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 22:29100,00860,397,98934,003,0003,000,0002,281,472
2Apr 11, 2025 22:29100,71960,305,16935,252,0002,014,0002,281,472
3Apr 11, 2025 22:29101,12261,091,46735,393,0002,022,0002,277,376