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 20, 2025 09:17Aniruddha DebAniruddha DebScore: 67,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 09:1867,47048,387,50223,966,000998,0002,531,328
2Apr 20, 2025 09:1867,71647,931,55723,051,0002,004,0002,531,328
3Apr 20, 2025 09:1767,81951,592,54124,090,0001,003,0002,424,832
4Apr 20, 2025 09:1867,87054,545,63024,108,0001,004,0002,424,832
5Apr 20, 2025 09:1867,87851,209,45423,106,0002,009,0002,428,928
6Apr 20, 2025 09:1867,89247,763,31225,120,00002,424,832
7Apr 20, 2025 09:1767,92249,243,92924,126,0001,005,0002,510,848
8Apr 20, 2025 09:1768,08447,231,52423,176,0002,015,0002,428,928
9Apr 20, 2025 09:1868,25947,366,66524,246,0001,010,0002,531,328