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 listMay 24, 2024 07:43StanStanScore: 190,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2024 07:43190,948136,940,77670,650,79202,224,128
2May 24, 2024 07:43190,949144,243,06170,651,09002,244,608
3May 24, 2024 07:43191,352140,062,32970,800,35402,228,224