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 19, 2026 14:30Victor MerckléVictor MerckléScore: 2,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 14:362,84532,339,77422,298,0001,032,0002,117,632stderr
2Aug 19, 2026 14:362,88333,928,26522,618,0001,027,0002,117,632stderr
3Aug 19, 2026 14:362,93232,390,89723,032,0001,012,0002,117,632stderr
4Aug 19, 2026 14:362,93532,251,81023,044,0001,023,0002,117,632stderr
5Aug 19, 2026 14:362,93833,117,82223,068,0001,030,0002,117,632stderr
6Aug 19, 2026 14:362,96133,274,47423,269,0001,013,0002,117,632stderr
7Aug 19, 2026 14:365,50153,309,34944,004,0001,112,0002,117,632stderr
8Aug 19, 2026 14:365,50253,263,68544,102,0001,021,0002,117,632stderr
9Aug 19, 2026 14:365,58954,972,43644,715,0001,120,0002,117,632stderr