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:23KeefeKeefeScore: 76,665Success
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:2376,54355,414,82225,287,0003,034,0002,289,664
2Jan 1, 2026 05:2376,66554,258,23927,353,0001,013,0002,281,472
3Jan 1, 2026 05:2377,22255,187,64626,532,0002,040,0002,273,280