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 listMar 12, 2026 21:44Josu San MartinJosu San MartinScore: 11,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 21:453,33356,568,13426,322,0001,012,0002,437,120
2Mar 12, 2026 21:453,35150,512,07627,478,00002,478,080
3Mar 12, 2026 21:4511,125112,171,84790,227,0001,002,0002,449,408
4Mar 12, 2026 21:4411,140115,939,36691,351,00002,428,928
5Mar 12, 2026 21:4411,154117,004,25790,454,0001,005,0002,379,776
6Mar 12, 2026 21:4411,187122,977,64189,742,0001,994,0002,404,352