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 listApr 26, 2025 14:12Dmitry YudakovDmitry YudakovScore: 115,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2025 14:12112,1763,727,254,8233,676,810,00024,985,0002,490,368
2Apr 26, 2025 14:12115,0473,828,395,3413,773,581,00022,985,0002,514,944
3Apr 26, 2025 14:12118,1413,927,509,3823,867,667,00030,981,0002,428,928