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 listOct 12, 2025 02:55Marco BarboneMarco BarboneScore: 85,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 02:5585,1492,838,045,5002,791,933,00017,986,0002,326,528
2Oct 12, 2025 02:5585,3342,848,707,2062,797,026,00018,986,0002,482,176
3Oct 12, 2025 02:5585,5002,855,199,8862,805,504,00015,991,0002,330,624
4Oct 12, 2025 02:5585,8212,863,548,4212,815,112,00016,988,0002,326,528
5Oct 12, 2025 02:5585,8942,871,673,1102,820,494,00013,992,0002,273,280
6Oct 12, 2025 02:5586,1122,874,572,3722,826,699,00014,987,0002,338,816
7Oct 12, 2025 02:5586,5032,883,949,9492,837,611,00016,979,0002,330,624
8Oct 12, 2025 02:5586,5192,884,586,4682,841,152,00013,985,0002,297,856
9Oct 12, 2025 02:5586,9152,893,593,7112,853,220,00014,985,0002,498,560