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 listMar 9, 2026 20:18Pavel SamyginPavel SamyginScore: 14,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 20:1814,166496,747,790450,485,00016,980,0002,310,144
2Mar 9, 2026 20:1814,179502,715,794451,915,00015,997,0002,314,240
3Mar 9, 2026 20:1814,202496,831,458451,693,00016,988,0002,371,584
4Mar 9, 2026 20:1814,232498,562,283452,662,00016,987,0002,310,144
5Mar 9, 2026 20:1814,246497,840,205454,128,00016,004,0002,306,048
6Mar 9, 2026 20:1814,259498,582,814453,564,00016,983,0002,301,952
7Mar 9, 2026 20:1814,322506,253,255457,631,00014,987,0002,310,144
8Mar 9, 2026 20:1814,402501,334,928459,262,00016,009,0002,281,472
9Mar 9, 2026 20:1814,411511,204,704459,564,00015,984,0002,314,240