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 23, 2025 13:01AnSaAnSaScore: 71,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 13:0171,2412,377,330,2862,321,960,00028,987,0002,527,232
2Dec 23, 2025 13:0171,2722,380,767,0442,317,978,00033,985,0002,367,488
3Dec 23, 2025 13:0171,4102,383,859,6552,318,559,00037,976,0002,379,776
4Dec 23, 2025 13:0171,4282,384,022,5972,324,143,00032,973,0002,367,488
5Dec 23, 2025 13:0171,8122,401,623,0472,333,801,00035,981,0002,416,640
6Dec 23, 2025 13:0171,8272,397,561,0162,336,304,00033,975,0002,416,640
7Dec 23, 2025 13:0171,9212,406,247,4422,343,427,00029,979,0002,416,640
8Dec 23, 2025 13:0172,1922,415,100,1632,344,379,00037,973,0002,363,392
9Dec 23, 2025 13:0174,3222,482,810,3742,417,645,00034,980,0002,416,640