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,192Success
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,70555,906,74528,117,0001,004,0002,289,664
2Apr 18, 2025 22:4579,19252,657,06227,281,0002,020,0002,269,184
3Apr 18, 2025 22:4579,36251,693,34228,352,0001,012,0002,527,232