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 28, 2025 08:32mebowlermebowlerScore: 462,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 08:32461,005206,933,67059,850,000110,722,0002,260,992
2Jan 28, 2025 08:32462,265197,237,52959,013,000112,025,0002,469,888
3Jan 28, 2025 08:32464,316202,008,72457,931,000113,866,0002,289,664