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 23, 2025 08:37Daniel MastalerzDaniel MastalerzScore: 67,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 08:3766,1292,209,017,5762,170,280,00011,990,0002,322,432
2Oct 23, 2025 08:3766,5782,224,822,1112,187,095,0009,995,0002,330,624
3Oct 23, 2025 08:3766,8282,232,831,2032,195,318,0009,992,0002,314,240
4Oct 23, 2025 08:3767,0452,237,785,6022,197,500,00014,989,0002,338,816
5Oct 23, 2025 08:3767,2432,248,117,9402,210,022,0008,991,0002,326,528
6Oct 23, 2025 08:3767,5202,252,797,6542,217,177,00010,995,0002,326,528
7Oct 23, 2025 08:3767,6122,265,837,1712,221,208,0009,996,0002,273,280
8Oct 23, 2025 08:3768,5372,290,187,5492,249,713,00011,993,0002,273,280
9Oct 23, 2025 08:3768,5482,288,072,3652,250,104,00011,989,0002,273,280