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 listMay 1, 2026 18:04Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 18:060120,478,953101,100,0003,002,0002,420,736expected "2113991549 ", got "2134893100 "
2May 1, 2026 18:0612,646117,928,78599,713,0003,988,0002,330,624
3May 1, 2026 18:0612,647122,267,163101,713,0001,994,0002,326,528
4May 1, 2026 18:0612,666121,232,888101,850,0002,016,0002,416,640
5May 1, 2026 18:0612,698123,623,692102,123,0002,002,0002,416,640
6May 1, 2026 18:0612,700118,122,896101,140,0003,004,0002,416,640
7May 1, 2026 18:0612,727120,797,011103,363,0001,003,0002,420,736
8May 1, 2026 18:0612,755121,610,742103,591,0001,005,0002,424,832
9May 1, 2026 18:0612,770119,548,947102,726,0001,994,0002,437,120