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 12, 2025 04:33Chandrasekaran AkashChandrasekaran AkashScore: 68,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2025 04:3367,75445,111,84024,067,0001,002,0002,449,408
2Apr 12, 2025 04:3367,81449,281,80424,088,0001,003,0002,531,328
3Apr 12, 2025 04:3367,85751,553,19724,103,0001,004,0002,269,184
4Apr 12, 2025 04:3367,86246,420,65323,101,0002,008,0002,531,328
5Apr 12, 2025 04:3368,01949,270,34223,154,0002,013,0002,531,328
6Apr 12, 2025 04:3368,07848,477,45024,182,0001,007,0002,441,216
7Apr 12, 2025 04:3368,19243,485,71024,222,0001,009,0002,531,328
8Apr 12, 2025 04:3368,26847,520,18624,249,0001,010,0002,531,328
9Apr 12, 2025 04:3368,29747,290,16823,249,0002,021,0002,449,408