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 20, 2026 19:35Charles CabergsCharles CabergsScore: 71,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 19:3671,01052,000,11324,253,0002,021,0002,256,896
2Apr 20, 2026 19:3671,09155,531,83024,281,0002,023,0002,351,104
3Apr 20, 2026 19:3671,27246,664,37625,357,0001,014,0002,355,200