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 21, 2025 13:30Cameron AavikCameron AavikScore: 32,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 13:3032,3441,096,938,903993,397,00073,955,0002,445,312
2Jan 21, 2025 13:3032,4851,099,097,6811,008,995,00062,999,0002,293,760
3Jan 21, 2025 13:3032,7151,109,471,5771,019,615,00059,977,0002,547,712