Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listAug 16, 2026 00:00marko1597marko1597Score: 2,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 00:252,91332,347,80122,836,0001,056,0002,117,632stderr
2Aug 16, 2026 00:252,92632,185,94522,935,0001,065,0002,117,632stderr
3Aug 16, 2026 00:252,92732,434,59522,920,0001,087,0002,117,632stderr
4Aug 16, 2026 00:252,92732,430,90222,920,0001,082,0002,117,632stderr
5Aug 16, 2026 00:252,93832,293,35223,015,0001,084,0002,117,632stderr
6Aug 16, 2026 00:252,95132,701,27323,105,0001,096,0002,117,632stderr
7Aug 16, 2026 00:252,95132,697,89923,091,0001,108,0002,117,632stderr
8Aug 16, 2026 00:257,08266,539,07056,031,0002,049,0002,117,632stderr
9Aug 16, 2026 00:257,21467,355,85856,998,0002,164,0002,117,632stderr