TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJan 28, 2025 09:46mebowlermebowlerScore: 275,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:04272,457132,920,72361,883,00038,926,0002,400,256
2Jan 28, 2025 09:04273,486122,969,24961,115,00040,075,0002,297,856
3Jan 28, 2025 09:04273,657122,115,19948,120,00053,133,0002,293,760
4Jan 28, 2025 09:04274,059125,686,39753,211,00048,191,0002,297,856
5Jan 28, 2025 09:04274,162126,796,51258,253,00043,187,0002,400,256
6Jan 28, 2025 09:04275,135131,848,17866,869,00034,931,0002,379,776
7Jan 28, 2025 09:46275,149127,727,95856,891,00044,914,0002,396,160
8Jan 28, 2025 09:04275,859126,689,26061,041,00041,027,0002,297,856
9Jan 28, 2025 09:04276,143126,356,88159,100,00043,073,0002,387,968
10Jan 28, 2025 09:46276,265127,492,88362,133,00040,085,0002,297,856
11Jan 28, 2025 09:04276,773126,223,13045,179,00057,227,0002,297,856
12Jan 28, 2025 09:46278,476128,857,14674,026,00029,010,0002,293,760