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 8, 2021 13:28Yuriy LyfenkoYuriy LyfenkoScore: 67,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 13:2866,989577,392,60024,785,96102,244,608
2Jul 8, 2021 13:2867,190580,223,07424,860,44202,244,608
3Jul 8, 2021 13:2867,296592,978,47224,899,36602,265,088