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 11, 2021 06:56Sergey StreminSergey StreminScore: 164,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 06:56162,686111,990,80860,193,99802,215,936
2Sep 11, 2021 06:56164,735119,804,99660,951,92102,203,648
3Sep 11, 2021 06:56170,172121,705,02562,963,62902,211,840