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 07:15olliecrowolliecrowScore: 3,315Success
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 07:163,29547,316,05825,019,0002,001,0002,420,736
2Apr 29, 2026 07:163,30045,878,44725,058,0002,004,0002,469,888
3Apr 29, 2026 07:163,30145,711,82024,062,0003,007,0002,330,624
4Apr 29, 2026 07:163,30241,431,54124,075,0003,009,0002,338,816
5Apr 29, 2026 07:163,31547,223,83825,175,0002,014,0002,330,624
6Apr 29, 2026 07:1623,763211,327,986191,860,0002,997,0002,383,872
7Apr 29, 2026 07:1623,783209,586,131191,028,0004,000,0002,535,424
8Apr 29, 2026 07:1623,839217,985,364190,499,0004,986,0002,482,176
9Apr 29, 2026 07:1623,850214,899,983192,579,0002,993,0002,486,272