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:09Chandrasekaran AkashChandrasekaran AkashScore: 60,900Success
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:0960,51649,821,77021,374,0001,017,0002,269,184
2Apr 18, 2025 02:0960,68943,476,46921,435,0001,020,0002,269,184
3Apr 18, 2025 02:0960,71443,311,06821,443,0001,021,0002,531,328
4Apr 18, 2025 02:0960,73841,096,94521,452,0001,021,0002,527,232
5Apr 18, 2025 02:0960,90044,615,31222,533,00002,449,408
6Apr 18, 2025 02:0960,91950,770,57722,540,00002,531,328
7Apr 18, 2025 02:0960,99544,997,46922,568,00002,441,216
8Apr 18, 2025 02:0961,07348,794,70721,570,0001,027,0002,445,312
9Apr 18, 2025 02:0961,68146,995,28320,838,0001,984,0002,445,312