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: 7,437Success
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:562,83131,705,45522,067,0001,148,0002,117,632stderr
2Aug 16, 2026 10:562,84631,718,74922,207,0001,134,0002,117,632stderr
3Aug 16, 2026 10:562,86431,952,91622,273,0001,212,0002,117,632stderr
4Aug 16, 2026 10:567,41869,258,44657,808,0003,026,0002,117,632stderr
5Aug 16, 2026 10:567,43769,456,39757,937,0003,050,0002,117,632stderr
6Aug 16, 2026 10:567,44669,275,70257,946,0003,113,0002,117,632stderr
7Aug 16, 2026 10:567,45669,618,52258,133,0003,007,0002,117,632stderr
8Aug 16, 2026 10:567,46669,458,67157,970,0003,258,0002,117,632stderr
9Aug 16, 2026 10:567,51270,123,25558,345,0003,255,0002,117,632stderr