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 23, 2024 17:08StanStanScore: 1,541,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:081,541,494642,707,667570,352,69402,256,896
2May 23, 2024 17:081,541,846634,851,603570,483,12202,195,456
3May 23, 2024 17:081,542,338651,106,563570,665,22202,199,552