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 18, 2025 23:57emily graceemily graceScore: 70,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 23:5770,08951,303,56523,939,0001,994,0002,277,376
2Apr 18, 2025 23:5770,21646,566,55523,982,0001,998,0002,289,664
3Apr 18, 2025 23:5770,66853,311,26124,136,0002,011,0002,277,376