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 19:03emily graceemily graceScore: 73,338Success
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 19:0373,24153,477,84525,092,0002,007,0002,273,280
2Apr 18, 2025 19:0373,33851,639,12125,125,0002,010,0002,289,664
3Apr 18, 2025 19:0373,34650,593,40025,128,0002,010,0002,289,664