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 22, 2024 04:48CemaCemaScore: 1,536,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 04:481,095,057466,212,781405,171,09102,256,896
2May 22, 2024 04:481,536,838637,817,037568,630,12602,252,800
3May 22, 2024 04:482,012,055815,354,925744,460,40302,260,992