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 listApr 15, 2026 00:45zielajzielajScore: 5,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 00:453,06547,016,23224,124,0001,005,0002,445,312
2Apr 15, 2026 00:445,39965,786,22543,268,0001,006,0002,371,584
3Apr 15, 2026 00:445,41868,021,82444,428,00002,486,272
4Apr 15, 2026 00:445,42673,128,27542,470,0002,022,0002,502,656
5Apr 15, 2026 00:455,43572,016,09143,551,0001,012,0002,428,928
6Apr 15, 2026 00:455,44069,454,82343,599,0001,013,0002,392,064