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 listMar 19, 2026 15:14limanjun99limanjun99Score: 98,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:1497,84157,920,21534,190,0002,011,0002,289,664
2Mar 19, 2026 15:1498,53864,595,97535,447,0001,012,0002,273,280
3Mar 19, 2026 15:1498,54159,016,88835,448,0001,012,0002,363,392
4Mar 19, 2026 15:1498,61960,295,31735,476,0001,013,0002,289,664
5Mar 19, 2026 15:1498,66555,233,59935,492,0001,014,0002,289,664
6Mar 19, 2026 15:1498,76257,743,66735,527,0001,015,0002,277,376
7Mar 19, 2026 15:1499,11965,800,22535,656,0001,018,0002,289,664
8Mar 19, 2026 15:1499,61965,500,32834,867,0001,992,0002,289,664
9Mar 19, 2026 15:14100,08163,269,72736,030,0001,000,0002,289,664