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 28, 2025 14:05zypehzypehScore: 51,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 14:0551,2301,715,105,7791,657,596,00032,991,0002,506,752
2Dec 28, 2025 14:0551,2801,718,369,9131,660,243,00031,985,0002,326,528
3Dec 28, 2025 14:0551,3901,725,128,1961,659,900,00035,976,0002,510,848
4Dec 28, 2025 14:0551,4221,724,229,8491,662,935,00033,978,0002,494,464
5Dec 28, 2025 14:0551,7591,734,473,7271,676,070,00031,982,0002,465,792
6Dec 28, 2025 14:0551,8711,738,351,9551,676,765,00034,974,0002,347,008
7Dec 28, 2025 14:0552,0481,747,582,7841,687,607,00029,993,0002,347,008
8Dec 28, 2025 14:0552,7341,770,027,4671,708,251,00031,985,0002,392,064
9Dec 28, 2025 14:0552,8521,769,401,2931,710,148,00033,983,0002,478,080