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 19, 2026 01:29zielajzielajScore: 5,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:302,75449,699,69319,504,0003,079,0002,322,432
2Apr 19, 2026 01:315,22868,634,41441,871,000996,0002,396,160
3Apr 19, 2026 01:315,23970,722,50340,959,0001,998,0002,408,448
4Apr 19, 2026 01:305,24770,787,69741,021,0002,001,0002,387,968
5Apr 19, 2026 01:315,24762,186,69142,025,0001,000,0002,457,600
6Apr 19, 2026 01:295,25163,775,15341,053,0002,002,0002,424,832
7Apr 19, 2026 01:295,25867,713,81241,107,0002,005,0002,519,040
8Apr 19, 2026 01:305,28567,839,46340,317,0003,023,0002,342,912
9Apr 19, 2026 01:295,31868,669,09242,592,0001,014,0002,314,240