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 24, 2025 22:21Dmitry YudakovDmitry YudakovScore: 179,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 22:21177,0895,873,033,6455,817,951,00025,986,0002,424,832
2Apr 24, 2025 22:21179,6015,955,626,4475,901,846,00024,986,0002,445,312
3Apr 24, 2025 22:21183,1626,071,005,3476,024,354,00019,987,0002,375,680