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 listApr 18, 2025 02:25Chandrasekaran AkashChandrasekaran AkashScore: 60,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 02:2560,60343,392,02021,404,0001,019,0002,445,312
2Apr 18, 2025 02:2560,60845,104,65322,425,00002,531,328
3Apr 18, 2025 02:2560,61643,200,42021,409,0001,019,0002,449,408
4Apr 18, 2025 02:2560,69549,072,94121,437,0001,020,0002,445,312
5Apr 18, 2025 02:2560,72246,267,80322,467,00002,527,232
6Apr 18, 2025 02:2560,72744,295,46822,469,00002,527,232
7Apr 18, 2025 02:2560,84141,539,31822,511,00002,523,136
8Apr 18, 2025 02:2560,86545,603,88922,520,00002,531,328
9Apr 18, 2025 02:2560,87850,962,43422,525,00002,441,216