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 11, 2025 15:20Rajarshi BasuRajarshi BasuScore: 25,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:2025,075852,890,240812,480,00014,990,0002,375,680
2Dec 11, 2025 15:2025,134860,691,758814,437,00014,989,0002,355,200
3Dec 11, 2025 15:2025,284862,337,062821,373,00012,990,0002,424,832
4Dec 11, 2025 15:2025,298857,727,933818,840,00015,996,0002,404,352
5Dec 11, 2025 15:2025,357861,071,773819,781,00017,016,0002,408,448
6Dec 11, 2025 15:2025,404867,887,350824,341,00013,988,0002,396,160
7Dec 11, 2025 15:2025,420870,235,080821,874,00016,997,0002,392,064
8Dec 11, 2025 15:2025,443863,518,099823,624,00015,992,0002,310,144
9Dec 11, 2025 15:2026,698916,031,794864,060,00016,981,0002,428,928