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 listMay 26, 2026 05:48Fernando AntunezFernando AntunezScore: 172,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 05:49171,5295,673,983,5135,611,505,00048,957,0002,113,536
2May 26, 2026 05:49172,8625,716,101,9455,645,435,00059,027,0002,113,536
3May 26, 2026 05:49173,8215,745,819,3485,686,411,00049,705,0002,113,536