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 21, 2025 02:24Steve BronderSteve BronderScore: 76,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 02:2475,87850,972,51526,070,0002,005,0002,433,024
2Apr 21, 2025 02:2476,23055,774,10826,191,0002,014,0002,433,024
3Apr 21, 2025 02:2476,23049,206,79326,191,0002,014,0002,519,040
4Apr 21, 2025 02:2476,40548,083,05826,251,0002,019,0002,433,024
5Apr 21, 2025 02:2476,48451,559,73526,278,0002,021,0002,433,024
6Apr 21, 2025 02:2476,50848,845,41626,286,0002,022,0002,428,928
7Apr 21, 2025 02:2476,51456,268,24528,310,00002,265,088
8Apr 21, 2025 02:2476,53848,447,10728,319,00002,531,328
9Apr 21, 2025 02:2476,91450,856,39228,458,00002,527,232