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 5, 2026 06:37olliecrowolliecrowScore: 3,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 06:383,28145,104,68625,862,0001,043,0002,310,144
2May 5, 2026 06:383,28143,285,97425,858,0001,053,0002,363,392
3May 5, 2026 06:383,28844,991,94625,894,0001,075,0002,551,808
4May 5, 2026 06:383,29242,560,15325,922,0001,077,0002,539,520
5May 5, 2026 06:383,35446,035,26826,426,0001,077,0002,383,872
6May 5, 2026 06:3858,664498,474,575478,805,0002,240,0002,531,328
7May 5, 2026 06:3859,678506,535,809487,194,0002,166,0002,535,424
8May 5, 2026 06:3859,765506,294,528487,922,0002,151,0002,498,560
9May 5, 2026 06:3859,876509,767,619488,783,0002,208,0002,441,216