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 24, 2026 19:43Dominique GarmierDominique GarmierScore: 18,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 19:4318,369182,163,89265,837,00084,790,0002,506,752
2Mar 24, 2026 19:4318,411182,894,64663,986,00086,982,0002,486,272
3Mar 24, 2026 19:4318,533174,557,13658,989,00092,983,0002,416,640