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 15, 2023 10:29Oleg KovalovOleg KovalovScore: 118,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 10:24118,2303,961,224,6323,901,590,51802,211,840
2Dec 15, 2023 10:24118,6493,985,079,5873,915,432,35702,211,840
3Dec 15, 2023 10:29118,8023,983,674,9183,920,463,34802,265,088
4Dec 15, 2023 10:29118,8703,992,934,0073,922,708,34202,224,128
5Dec 15, 2023 10:24118,9223,983,269,3183,924,438,95002,220,032
6Dec 15, 2023 10:29118,9543,996,246,6773,925,482,06202,215,936