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 7, 2021 23:58Yuriy LyfenkoYuriy LyfenkoScore: 150,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 23:58146,8341,056,432,70454,328,587060,993,536
2Jul 7, 2021 23:58150,9311,055,803,03855,844,371058,470,400
3Jul 7, 2021 23:58168,0001,013,867,26562,159,904063,074,304