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:17mebowlermebowlerScore: 276,838Success
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:17276,011127,329,80655,067,00047,057,0002,510,848
2Jan 28, 2025 09:17276,838133,705,49063,266,00039,164,0002,297,856
3Jan 28, 2025 09:17276,951124,423,97659,273,00043,199,0002,400,256