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 14, 2026 20:05Tomislav TunkovicTomislav TunkovicScore: 3,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:203,66938,476,34629,068,0001,025,0002,121,728stderr
2Aug 14, 2026 20:203,69038,649,79929,240,0001,024,0002,121,728stderr
3Aug 14, 2026 20:203,69439,390,60029,268,0001,024,0002,121,728stderr
4Aug 14, 2026 20:203,69738,782,42629,300,0001,020,0002,121,728stderr
5Aug 14, 2026 20:203,70038,781,69829,321,0001,027,0002,121,728stderr
6Aug 14, 2026 20:203,70539,269,16629,361,0001,027,0002,121,728stderr
7Aug 14, 2026 20:203,71039,536,16329,400,0001,026,0002,121,728stderr
8Aug 14, 2026 20:203,71139,509,73729,411,0001,024,0002,121,728stderr
9Aug 14, 2026 20:203,71838,964,09629,469,0001,024,0002,121,728stderr