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 22, 2025 14:48Rajarshi BasuRajarshi BasuScore: 4,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 14:484,821181,871,231157,093,0002,001,0002,285,568
2Dec 22, 2025 14:484,844183,919,331156,871,0002,997,0002,285,568
3Dec 22, 2025 14:484,846184,202,609156,926,0002,998,0002,285,568
4Dec 22, 2025 14:484,855183,276,507158,229,0002,002,0002,285,568
5Dec 22, 2025 14:484,859189,045,695157,354,0003,006,0002,285,568
6Dec 22, 2025 14:484,869184,103,059157,688,0002,994,0002,387,968
7Dec 22, 2025 14:484,876184,869,364157,921,0002,998,0002,281,472
8Dec 22, 2025 14:484,894188,220,548157,527,0003,988,0002,285,568
9Dec 22, 2025 14:484,898189,674,386158,656,0002,993,0002,285,568
10Dec 22, 2025 14:484,929188,871,158159,670,0002,993,0002,281,472
11Dec 22, 2025 14:485,028188,352,661162,918,0002,998,0002,347,008
12Dec 22, 2025 14:485,370201,399,757175,213,0002,002,0002,387,968