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 22, 2025 05:13Ian MckibbenIan MckibbenScore: 69,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 05:1369,86253,348,24824,855,000994,0002,428,928
2Jan 22, 2025 05:1369,87056,705,50124,858,000994,0002,531,328
3Jan 22, 2025 05:1369,87651,795,20423,866,0001,988,0002,433,024
4Jan 22, 2025 05:1369,88949,334,84025,859,00002,510,848
5Jan 22, 2025 05:1369,92750,083,89924,878,000995,0002,269,184
6Jan 22, 2025 05:1369,98945,035,73824,900,000996,0002,531,328
7Jan 22, 2025 05:1370,07050,964,12524,929,000997,0002,437,120
8Jan 22, 2025 05:1370,15149,252,29124,958,000998,0002,531,328
9Jan 22, 2025 05:1370,60556,851,69624,115,0002,009,0002,531,328