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 17, 2026 17:48Charles CabergsCharles CabergsScore: 37,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 17:4836,831322,540,037129,005,000173,006,0002,420,736
2Apr 17, 2026 17:4836,922326,562,205126,901,000175,863,0002,424,832
3Apr 17, 2026 17:4837,002329,171,701131,746,000171,669,0002,420,736
4Apr 17, 2026 17:4837,053330,118,513129,930,000173,906,0002,424,832
5Apr 17, 2026 17:4837,100332,788,544130,093,000174,124,0002,351,104
6Apr 17, 2026 17:4837,130336,043,323128,774,000175,692,0002,420,736
7Apr 17, 2026 17:4837,613336,532,473127,762,000180,664,0002,416,640
8Apr 17, 2026 17:4837,963337,766,009130,703,000180,590,0002,281,472
9Apr 17, 2026 17:4838,141341,798,761129,899,000182,858,0002,420,736