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 22, 2026 11:39BenBenScore: 156,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:40151,78172,247,18110,028,00046,131,0002,469,888
2Apr 22, 2026 11:40152,21373,677,62212,068,00044,251,0002,478,080
3Apr 22, 2026 11:40152,70272,451,80210,089,00046,411,0002,465,792
4Apr 22, 2026 11:40153,11873,045,4268,945,00047,709,0002,469,888
5Apr 22, 2026 11:40156,21378,104,1709,965,00047,834,0002,461,696
6Apr 22, 2026 11:40156,55678,598,7865,992,00051,934,0002,457,600
7Apr 22, 2026 11:40157,06275,160,5849,017,00049,096,0002,465,792
8Apr 22, 2026 11:40157,33775,881,79612,044,00046,171,0002,469,888
9Apr 22, 2026 11:40157,86772,002,94812,085,00046,326,0002,465,792