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 29, 2026 16:42Dominique GarmierDominique GarmierScore: 313,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 16:42149,4861,255,205,9771,223,785,0001,999,0002,408,448
2Mar 29, 2026 16:42313,8132,600,767,3012,571,271,0001,998,0002,457,600
3Mar 29, 2026 16:42315,4302,615,768,8772,584,531,0001,998,0002,437,120