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 listJun 16, 2023 19:50Ulyanov AlekseyUlyanov AlekseyScore: 21,364,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2023 19:5021,102,7117,870,974,2477,808,003,18002,277,376
2Jun 16, 2023 19:5021,364,9137,964,469,6307,905,017,99002,289,664
3Jun 16, 2023 19:5021,422,9287,989,549,3437,926,483,49302,281,472