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 listApr 16, 2025 00:51emily graceemily graceScore: 353,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 00:51344,827154,185,417126,582,0001,004,0002,277,376
2Apr 16, 2025 00:51353,824157,684,233128,917,0001,998,0002,277,376
3Apr 16, 2025 00:51358,357159,009,123131,596,000996,0002,289,664