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 listFeb 7, 2026 03:44Josu San MartinJosu San MartinScore: 4,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 03:413,92756,594,62930,190,0002,012,0002,461,696
2Feb 7, 2026 03:413,98556,891,75231,653,0001,021,0002,273,280
3Feb 7, 2026 03:414,01758,731,11829,948,0002,994,0002,347,008
4Feb 7, 2026 03:414,04058,564,02331,119,0002,007,0002,277,376
5Feb 7, 2026 03:414,05559,885,58128,210,0005,037,0002,396,160
6Feb 7, 2026 03:414,06859,969,61330,325,0003,032,0002,465,792
7Feb 7, 2026 03:444,07158,004,22229,339,0004,046,0002,334,720
8Feb 7, 2026 03:444,10059,211,46732,598,0001,018,0002,441,216
9Feb 7, 2026 03:414,10163,292,04329,554,0004,076,0002,359,296
10Feb 7, 2026 03:444,12462,552,43630,835,0002,984,0002,306,048
11Feb 7, 2026 03:414,15057,996,47931,027,0003,002,0002,478,080
12Feb 7, 2026 03:414,25056,871,16431,861,0002,987,0002,506,752