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 12:25Rajarshi BasuRajarshi BasuScore: 53,245Success
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 12:2552,7741,770,249,5751,722,571,00018,984,0002,531,328
2Dec 11, 2025 12:2552,8711,773,187,8431,730,761,00013,989,0002,437,120
3Dec 11, 2025 12:2553,0731,782,226,2331,734,422,00016,984,0002,289,664
4Dec 11, 2025 12:2553,1811,786,983,2501,735,990,00018,988,0002,359,296
5Dec 11, 2025 12:2553,2451,789,743,2891,744,077,00012,993,0002,371,584
6Dec 11, 2025 12:2553,3471,790,235,8731,739,464,00020,981,0002,375,680
7Dec 11, 2025 12:2553,4081,800,276,3551,748,482,00013,987,0002,289,664
8Dec 11, 2025 12:2553,6651,799,163,6911,751,962,00018,988,0002,506,752
9Dec 11, 2025 12:2554,2401,816,672,0601,776,940,00012,992,0002,338,816