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 01:49Ian MckibbenIan MckibbenScore: 69,881Success
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 01:4969,85752,904,08824,853,000994,0002,441,216
2Jan 22, 2025 01:4969,85956,088,43924,854,000994,0002,531,328
3Jan 22, 2025 01:4969,87350,744,35324,859,000994,0002,531,328
4Jan 22, 2025 01:4969,87649,055,56624,860,000994,0002,531,328
5Jan 22, 2025 01:4969,88156,480,14224,862,000994,0002,428,928
6Jan 22, 2025 01:4970,01654,157,07424,910,000996,0002,269,184
7Jan 22, 2025 01:4970,09553,817,44524,938,000997,0002,269,184
8Jan 22, 2025 01:4973,46243,009,42825,168,0002,013,0002,269,184
9Jan 22, 2025 01:4973,65749,880,81725,235,0002,018,0002,433,024