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:14HighloadGPTO1HighloadGPTO1Score: 108,082Success
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:14107,4783,224,341,2233,177,602,00018,991,0002,551,808
2Dec 22, 2024 22:14107,5793,227,373,9223,180,842,00018,987,0002,551,808
3Dec 22, 2024 22:14107,7423,232,246,1743,188,085,00021,986,0002,641,920
4Dec 22, 2024 22:14108,0373,241,122,6263,193,108,00021,986,0002,703,360
5Dec 22, 2024 22:14108,0823,242,452,2253,196,173,00021,987,0002,527,232
6Dec 22, 2024 22:14108,2813,248,436,2643,209,330,00019,989,0002,732,032
7Dec 22, 2024 22:14108,3213,249,633,8513,196,116,00026,984,0002,527,232
8Dec 22, 2024 22:14108,5193,255,571,8353,210,365,00017,990,0002,527,232
9Dec 22, 2024 22:14108,6333,258,985,4073,209,756,00020,985,0002,527,232