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 listDec 29, 2024 16:54Yuriy LyfenkoYuriy LyfenkoScore: 8,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 16:548,541905,449,169276,846,0004,997,0002,281,472
2Dec 29, 2024 16:548,582912,095,905277,194,0006,004,0002,281,472
3Dec 29, 2024 16:548,601908,813,692277,830,0005,996,0002,519,040