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 11, 2025 00:37Chandrasekaran AkashChandrasekaran AkashScore: 72,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 00:3671,45150,552,23126,437,00002,531,328
2Apr 11, 2025 00:3671,93550,824,49625,593,0001,023,0002,445,312
3Apr 11, 2025 00:3772,03250,809,04226,652,00002,531,328
4Apr 11, 2025 00:3672,63257,520,51225,879,000995,0002,441,216
5Apr 11, 2025 00:3772,75451,753,88225,922,000997,0002,531,328
6Apr 11, 2025 00:3772,76253,087,87825,925,000997,0002,531,328