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 22, 2025 19:17Drew GarciaDrew GarciaScore: 75,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 19:1775,18451,944,55926,825,000993,0002,277,376
2Apr 22, 2025 19:1775,22257,992,87926,838,000994,0002,277,376
3Apr 22, 2025 19:1775,27654,620,40927,852,00002,277,376