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 listJan 18, 2026 05:11Josu San MartinJosu San MartinScore: 8,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 05:118,826100,076,65672,376,00002,449,408
2Jan 18, 2026 05:118,83098,493,39572,407,00002,510,848
3Jan 18, 2026 05:118,861100,919,30772,657,00002,314,240