Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listDec 22, 2024 22:13HighloadGPTO1HighloadGPTO1Score: 119,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 22:13119,2043,576,126,1843,531,135,00021,988,0002,527,232
2Dec 22, 2024 22:13119,2153,576,439,9403,527,530,00021,984,0002,736,128
3Dec 22, 2024 22:13119,3733,581,202,5303,536,166,00020,989,0002,539,520
4Dec 22, 2024 22:13119,4203,582,614,5793,540,218,00019,989,0002,539,520
5Dec 22, 2024 22:13119,4543,583,616,8943,530,175,00016,991,0002,768,896
6Dec 22, 2024 22:13119,5103,585,287,6623,539,125,00020,988,0002,547,712
7Dec 22, 2024 22:13119,7433,592,277,0453,545,083,00018,989,0002,527,232
8Dec 22, 2024 22:13120,0983,602,949,4683,558,891,00021,986,0002,527,232
9Dec 22, 2024 22:13120,2773,608,313,7033,565,913,00017,989,0002,527,232