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 01:07Ian MckibbenIan MckibbenScore: 115,951Success
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 01:06114,95964,862,14641,523,0001,012,0002,289,664
2Jan 17, 2025 01:07115,01965,092,80842,557,00002,392,064
3Jan 17, 2025 01:06115,93865,870,21440,902,0001,995,0002,387,968
4Jan 17, 2025 01:06115,95163,639,45741,905,000997,0002,387,968
5Jan 17, 2025 01:07116,16264,333,05041,981,000999,0002,289,664
6Jan 17, 2025 01:07116,19267,741,98340,992,0001,999,0002,289,664