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 listAug 15, 2026 17:38Tomislav TunkovicTomislav TunkovicScore: 3,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:393,007107,714,51398,197,0001,062,00024,576
2Aug 15, 2026 17:393,009107,818,82098,295,0001,003,00024,576
3Aug 15, 2026 17:393,014108,545,08098,451,0001,013,00024,576
4Aug 15, 2026 17:393,015108,542,52698,499,0001,008,00024,576
5Aug 15, 2026 17:393,018108,106,62998,595,0001,004,00024,576
6Aug 15, 2026 17:393,019108,787,73298,640,0001,016,00024,576
7Aug 15, 2026 17:393,022108,164,14498,722,0001,004,00024,576
8Aug 15, 2026 17:393,024108,249,04198,676,0001,142,00024,576
9Aug 15, 2026 17:393,040109,155,87099,322,0001,003,00024,576