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 listApr 29, 2026 22:47olliecrowolliecrowScore: 24,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 22:483,57346,102,26728,290,0001,010,0002,306,048
2Apr 29, 2026 22:483,58248,474,50928,362,0001,012,0002,560,000
3Apr 29, 2026 22:4823,977215,532,518192,624,0003,992,0002,371,584
4Apr 29, 2026 22:4824,005212,367,625194,845,0001,998,0002,547,712
5Apr 29, 2026 22:4824,072214,909,933192,385,0005,010,0002,482,176
6Apr 29, 2026 22:4824,111215,256,418193,724,0003,994,0002,379,776
7Apr 29, 2026 22:4824,147218,150,316195,011,0003,000,0002,527,232
8Apr 29, 2026 22:4824,168217,526,932196,177,0002,001,0002,551,808
9Apr 29, 2026 22:4824,265214,352,482195,977,0002,999,0002,400,256