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 listAug 16, 2025 14:32Aniruddha DebAniruddha DebScore: 66,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 14:3266,29246,683,64024,528,00002,420,736
2Aug 16, 2025 14:3266,33552,274,09724,544,00002,420,736
3Aug 16, 2025 14:3266,35743,286,66624,552,00002,531,328
4Aug 16, 2025 14:3266,44947,078,62923,562,0001,024,0002,510,848
5Aug 16, 2025 14:3266,57350,819,62924,632,00002,428,928
6Aug 16, 2025 14:3266,67051,057,18624,668,00002,428,928
7Aug 16, 2025 14:3267,09551,208,75923,832,000993,0002,531,328
8Aug 16, 2025 14:3267,17657,912,98723,861,000994,0002,531,328
9Aug 16, 2025 14:3267,19551,238,06824,862,00002,416,640