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 listSep 3, 2026 04:23Josu San MartinJosu San MartinScore: 4,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:244,84150,481,61237,398,0002,299,0002,113,536
2Sep 3, 2026 04:244,85450,632,46537,398,0002,408,0002,113,536
3Sep 3, 2026 04:244,85649,919,14637,455,0002,371,0002,113,536
4Sep 3, 2026 04:244,88752,121,05638,023,0002,054,0002,113,536
5Sep 3, 2026 04:244,88950,096,70337,773,0002,321,0002,113,536
6Sep 3, 2026 04:244,92850,700,62238,142,0002,269,0002,113,536
7Sep 3, 2026 04:2412,230110,340,84793,564,0006,725,0002,113,536
8Sep 3, 2026 04:2420,830180,817,925164,520,0006,287,0002,117,632
9Sep 3, 2026 04:2421,991191,230,123173,655,0006,673,0002,113,536