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 30, 2026 04:32limanjun99limanjun99Score: 67,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 04:3267,43549,875,70123,953,000998,0002,281,472
2Mar 30, 2026 04:3267,55454,435,09922,996,0001,999,0002,408,448
3Mar 30, 2026 04:3267,60550,690,86524,014,0001,000,0002,404,352
4Mar 30, 2026 04:3267,70358,150,44524,048,0001,002,0002,396,160
5Mar 30, 2026 04:3267,82249,226,93324,091,0001,003,0002,281,472
6Mar 30, 2026 04:3267,89548,748,78323,112,0002,009,0002,281,472
7Mar 30, 2026 04:3267,93246,427,06124,130,0001,005,0002,506,752
8Mar 30, 2026 04:3267,97352,449,37723,138,0002,012,0002,408,448
9Mar 30, 2026 04:3268,08648,683,15424,185,0001,007,0002,281,472