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 19, 2025 07:30Ian MckibbenIan MckibbenScore: 75,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:2575,29254,625,02626,864,000994,0002,424,832
2Jan 19, 2025 07:2575,48953,694,90426,934,000997,0002,424,832
3Jan 19, 2025 07:3075,58150,096,70026,967,000998,0002,531,328
4Jan 19, 2025 07:3075,75447,350,08227,028,0001,001,0002,531,328
5Jan 19, 2025 07:3075,89248,590,92126,075,0002,005,0002,433,024
6Jan 19, 2025 07:2576,05747,574,20527,136,0001,005,0002,531,328