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 5, 2022 21:19Franek KortaFranek KortaScore: 241,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 21:19241,067157,875,73789,194,84602,256,896
2Aug 5, 2022 21:19241,665149,418,47189,415,87402,256,896
3Aug 5, 2022 21:19244,916151,669,60090,618,95702,224,128