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:44Drew GarciaDrew GarciaScore: 100,057Success
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:4499,85760,778,33333,952,0002,995,0002,277,376
2Apr 11, 2025 22:44100,05764,249,11634,020,0003,001,0002,289,664
3Apr 11, 2025 22:44103,07369,809,16037,134,0001,003,0002,269,184