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 16, 2026 10:45marko1597marko1597Score: 2,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 10:572,85631,680,97822,271,0001,155,0002,117,632stderr
2Aug 16, 2026 10:572,86131,803,72822,298,0001,165,0002,117,632stderr
3Aug 16, 2026 10:572,86631,812,25422,364,0001,139,0002,117,632stderr
4Aug 16, 2026 10:572,86831,825,56122,341,0001,181,0002,117,632stderr
5Aug 16, 2026 10:572,87631,840,74422,396,0001,193,0002,117,632stderr
6Aug 16, 2026 10:577,80872,310,86260,976,0003,057,0002,117,632stderr
7Aug 16, 2026 10:577,84572,665,49461,216,0003,119,0002,117,632stderr
8Aug 16, 2026 10:578,00774,019,08962,390,0003,271,0002,117,632stderr
9Aug 16, 2026 10:578,03975,546,86962,656,0003,267,0002,117,632stderr