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:36emily graceemily graceScore: 77,319Success
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:3677,24959,130,04227,562,0001,020,0002,281,472
2Apr 18, 2025 19:3677,31949,394,58528,608,00002,289,664
3Apr 18, 2025 19:3677,93558,291,16726,848,0001,988,0002,289,664