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:38StanStanScore: 379,121Success
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:38378,793208,039,793140,153,53602,236,416
2May 24, 2024 07:38379,121201,646,433140,274,86402,252,800
3May 24, 2024 07:38379,640195,631,668140,466,92302,256,896