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 07:44Emanuele BolognesiEmanuele BolognesiScore: 631,708Success
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 07:44626,516257,915,32159,951,000171,860,0002,461,696
2Apr 18, 2025 07:44627,808261,513,09359,817,000172,472,0002,363,392
3Apr 18, 2025 07:44629,932257,407,39860,019,000173,056,0002,297,856
4Apr 18, 2025 07:44630,214258,815,87261,047,000172,132,0002,404,352
5Apr 18, 2025 07:44631,708260,317,76059,931,000173,801,0002,408,448
6Apr 18, 2025 07:44635,911260,665,10559,072,000176,215,0002,400,256
7Apr 18, 2025 07:44641,892263,154,78659,874,000177,626,0002,347,008
8Apr 18, 2025 07:44644,211266,135,57758,841,000179,517,0002,400,256
9Apr 18, 2025 07:44645,532259,162,88458,962,000179,885,0002,400,256