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 29, 2024 13:05AnSaAnSaScore: 177,910Success
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, 2024 13:05177,043119,675,52765,505,79102,269,184
2Jan 29, 2024 13:05177,910132,457,99865,826,64902,252,800
3Jan 29, 2024 13:05178,100127,654,48565,897,07402,252,800