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:33mebowlermebowlerScore: 276,497Success
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:33273,941123,034,33655,195,00046,163,0002,297,856
2Jan 28, 2025 09:33274,459130,785,88363,343,00038,207,0002,297,856
3Jan 28, 2025 09:33275,203131,764,93661,894,00039,931,0002,293,760
4Jan 28, 2025 09:33275,641130,074,98953,993,00047,994,0002,383,872
5Jan 28, 2025 09:33276,497120,985,20057,170,00045,134,0002,379,776
6Jan 28, 2025 09:33276,911124,950,11160,269,00042,188,0002,387,968
7Jan 28, 2025 09:33276,997127,315,01658,278,00044,211,0002,297,856
8Jan 28, 2025 09:33277,205128,278,10855,305,00047,261,0002,293,760
9Jan 28, 2025 09:33281,081127,056,43256,000,00048,000,0002,392,064