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 29, 2026 18:47lipapipalipapipaScore: 14,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 18:4714,446146,204,616116,453,0002,007,0002,457,600
2Jan 29, 2026 18:4714,481149,773,839114,753,0003,991,0002,400,256
3Jan 29, 2026 18:4714,481152,035,263112,759,0005,987,0002,396,160
4Jan 29, 2026 18:4714,485144,229,510116,779,0001,996,0002,465,792
5Jan 29, 2026 18:4714,487150,452,286115,803,0002,994,0002,445,312
6Jan 29, 2026 18:4714,500145,662,157115,906,0002,997,0002,387,968
7Jan 29, 2026 18:4714,513143,924,392116,008,0003,000,0002,318,336
8Jan 29, 2026 18:4714,559144,259,486118,379,0001,003,0002,416,640
9Jan 29, 2026 18:4714,838154,064,873116,683,0004,986,0002,310,144