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 listAug 18, 2026 11:21Josu San MartinJosu San MartinScore: 11,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 11:233,38837,727,40526,750,0001,035,0002,117,632
2Aug 18, 2026 11:233,39837,835,02726,829,0001,037,0002,117,632
3Aug 18, 2026 11:233,40137,814,88026,831,0001,063,0002,117,632
4Aug 18, 2026 11:2311,435105,023,69092,762,0001,010,0002,117,632
5Aug 18, 2026 11:2311,440103,688,65091,792,0002,023,0002,117,632
6Aug 18, 2026 11:2311,456103,856,88791,903,0002,037,0002,117,632
7Aug 18, 2026 11:2311,459104,009,55091,938,0002,028,0002,117,632
8Aug 18, 2026 11:2311,459103,901,89992,957,0001,011,0002,117,632
9Aug 18, 2026 11:2311,541104,547,06792,615,0002,026,0002,117,632