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 2, 2023 12:12A L ManningA L ManningScore: 53,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2023 12:1352,8141,827,577,4551,742,846,89902,310,144
2Jan 2, 2023 12:1352,8401,827,592,9611,743,718,94702,310,144
3Jan 2, 2023 12:1253,3231,829,052,1441,759,664,25802,289,664
4Jan 2, 2023 12:1353,4581,832,615,7221,764,113,79502,293,760
5Jan 2, 2023 12:1254,3191,858,291,5421,792,511,29602,301,952
6Jan 2, 2023 12:1255,6911,889,680,6061,837,809,29202,310,144