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 listJun 26, 2026 07:23Zhou180Zhou180Score: 22,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:243,60338,693,64728,481,0001,065,0002,117,632
2Jun 26, 2026 07:243,63138,876,84028,716,0001,061,0002,117,632
3Jun 26, 2026 07:2421,870188,459,272177,333,0002,009,0002,117,632
4Jun 26, 2026 07:2421,916188,871,037177,708,0002,011,0002,117,632
5Jun 26, 2026 07:2422,082190,211,672179,067,0002,011,0002,117,632
6Jun 26, 2026 07:2422,120190,662,575178,362,0003,024,0002,117,632
7Jun 26, 2026 07:2422,189191,138,311179,940,0002,012,0002,117,632
8Jun 26, 2026 07:2422,191191,176,056179,956,0002,013,0002,117,632
9Jun 26, 2026 07:2423,079200,363,932187,241,0002,011,0002,117,632