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 22, 2025 11:38Oleg KovalovOleg KovalovScore: 422,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 11:38421,562180,039,911106,985,00048,993,0002,375,680
2Jan 22, 2025 11:38421,965181,049,101102,083,00054,044,0002,277,376
3Jan 22, 2025 11:38421,973184,062,994102,085,00054,045,0002,281,472
4Jan 22, 2025 11:38422,151181,914,280104,131,00052,065,0002,289,664
5Jan 22, 2025 11:38422,551183,211,54997,214,00059,130,0002,523,136
6Jan 22, 2025 11:38423,405184,623,615105,444,00051,216,0002,289,664
7Jan 22, 2025 11:38423,700179,993,751117,827,00038,942,0002,265,088
8Jan 22, 2025 11:38423,903179,607,768112,888,00043,956,0002,519,040
9Jan 22, 2025 11:38424,681179,064,291108,091,00049,041,0002,289,664