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 11, 2024 20:44Franek KortaFranek KortaScore: 61,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2024 20:4460,69541,905,29721,437,0001,020,0002,531,328
2Aug 11, 2024 20:4460,70545,978,58122,461,00002,531,328
3Aug 11, 2024 20:4460,80545,417,39221,476,0001,022,0002,531,328
4Aug 11, 2024 20:4460,84646,008,28520,467,0002,046,0002,490,368
5Aug 11, 2024 20:4460,90044,925,35421,509,0001,024,0002,531,328
6Aug 11, 2024 20:4460,92742,033,44521,519,0001,024,0002,269,184
7Aug 11, 2024 20:4461,03844,778,73122,584,00002,527,232
8Aug 11, 2024 20:4461,04949,161,73722,588,00002,531,328
9Aug 11, 2024 20:4461,11647,646,41822,613,00002,265,088
10Aug 11, 2024 20:4465,52192,862,55924,242,86602,215,936
11Aug 11, 2024 20:4465,63392,422,23424,284,03802,215,936
12Aug 11, 2024 20:4465,63884,816,19624,285,95702,215,936