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 22:45emily graceemily graceScore: 79,024Success
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 22:4578,81449,618,65527,150,0002,011,0002,379,776
2Apr 18, 2025 22:4579,02451,119,24227,223,0002,016,0002,523,136
3Apr 18, 2025 22:4579,49748,973,24628,400,0001,014,0002,289,664