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 17, 2025 00:53Ian MckibbenIan MckibbenScore: 747,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 00:53747,795299,683,028275,686,000998,0002,273,280
2Jan 17, 2025 00:53747,941304,844,087275,739,000999,0002,277,376
3Jan 17, 2025 00:53747,949303,639,147274,743,0001,998,0002,277,376