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 listJan 1, 2026 05:34KeefeKeefeScore: 75,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 05:3475,68450,254,34626,003,0002,000,0002,396,160
2Jan 1, 2026 05:3475,81950,166,16026,050,0002,003,0002,269,184
3Jan 1, 2026 05:3476,26853,402,07427,212,0001,007,0002,400,256