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 listNov 4, 2025 21:25AntonAntonScore: 52,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 21:2551,847450,446,682252,493,000172,653,0002,314,240
2Nov 4, 2025 21:2551,871455,356,022251,610,000173,731,0002,314,240
3Nov 4, 2025 21:2551,901447,665,258253,753,000171,832,0002,400,256
4Nov 4, 2025 21:2552,406457,599,592258,839,000170,893,0002,473,984
5Nov 4, 2025 21:2552,464457,507,460259,522,000170,685,0002,396,160
6Nov 4, 2025 21:2552,488453,332,485257,640,000172,758,0002,408,448
7Nov 4, 2025 21:2552,489454,530,700257,646,000172,762,0002,297,856
8Nov 4, 2025 21:2552,541453,695,158257,903,000172,935,0002,387,968
9Nov 4, 2025 21:2552,543453,184,469255,914,000174,941,0002,469,888