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 listJul 28, 2021 06:53Andrey KuzminAndrey KuzminScore: 5,441,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2021 06:535,440,5482,069,984,9192,013,002,88802,260,992
2Jul 28, 2021 06:535,441,8242,074,537,6782,013,474,82102,244,608
3Jul 28, 2021 06:535,442,4042,079,409,4852,013,689,54402,256,896