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 01:51olliecrowolliecrowScore: 23,019Success
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 01:522,94741,034,94321,152,0003,021,0002,420,736
2Apr 29, 2026 01:522,94944,101,95622,169,0002,015,0002,326,528
3Apr 29, 2026 01:522,96143,075,64023,272,0001,011,0002,301,952
4Apr 29, 2026 01:5222,958207,244,323186,255,0002,002,0002,506,752
5Apr 29, 2026 01:5223,019203,993,647185,760,0002,996,0002,301,952
6Apr 29, 2026 01:5223,057205,968,854185,070,0004,001,0002,564,096
7Apr 29, 2026 01:5223,092207,384,909186,352,0003,005,0002,416,640
8Apr 29, 2026 01:5223,148206,971,690184,825,0004,995,0002,453,504
9Apr 29, 2026 01:5223,169206,132,629184,988,0004,999,0002,400,256