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 15, 2021 23:16Yurkov AlekseyYurkov AlekseyScore: 99,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 23:1699,42698,106,33336,787,70402,256,896
2Jul 15, 2021 23:1699,620100,112,11536,859,23102,256,896
3Jul 15, 2021 23:16100,304102,324,91437,112,65302,256,896