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 listSep 30, 2022 20:39PhibPhibScore: 1,531,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2022 20:391,411,771585,324,117522,355,10902,310,144
2Sep 30, 2022 20:391,531,180626,542,849566,536,64902,301,952
3Sep 30, 2022 20:391,885,889760,488,776697,778,94102,248,704