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:36KeefeKeefeScore: 75,916Success
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:3675,88958,250,24426,074,0002,005,0002,269,184
2Jan 1, 2026 05:3675,91649,544,60927,086,0001,003,0002,269,184
3Jan 1, 2026 05:3675,93255,810,69327,092,0001,003,0002,269,184