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 listNov 29, 2023 07:39weedgeweedgeScore: 674,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2023 07:39669,891311,354,199247,859,71102,289,664
2Nov 29, 2023 07:39674,607316,321,302249,604,67302,289,664
3Nov 29, 2023 07:39675,229334,893,555249,834,62302,289,664