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 listFeb 15, 2023 00:30LiamLiamScore: 21,279,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 00:3021,269,4467,930,034,2207,869,694,85002,297,856
2Feb 15, 2023 00:3021,279,5017,945,075,7457,873,415,41502,289,664
3Feb 15, 2023 00:3021,316,9487,955,464,9877,887,270,89202,289,664