Unique strings Sergey Svistunov

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 listJan 22, 2025 21:48Miriam VellacottMiriam VellacottScore: 96,643Success
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 21:4895,8513,195,443,8963,086,116,00076,953,0002,469,888
2Jan 22, 2025 21:4895,8933,195,571,1113,089,521,00074,964,0002,433,024
3Jan 22, 2025 21:4896,1623,200,518,9883,094,395,00078,959,0002,469,888
4Jan 22, 2025 21:4896,4293,202,576,8543,104,191,00077,954,0002,433,024
5Jan 22, 2025 21:4896,6433,221,629,5033,108,261,00080,954,0002,428,928
6Jan 22, 2025 21:4896,9233,224,508,7143,126,491,00071,965,0002,465,792
7Jan 22, 2025 21:4897,6843,255,404,2183,153,611,00069,969,0002,469,888
8Jan 22, 2025 21:4897,7943,256,982,0323,154,242,00072,959,0002,445,312
9Jan 22, 2025 21:4897,8893,258,076,6123,148,364,00081,957,0002,441,216