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 listMar 19, 2026 14:14Dominique GarmierDominique GarmierScore: 23,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:3623,274798,429,747759,067,0008,988,0002,453,504
2Mar 19, 2026 14:1423,322794,250,859762,639,0006,996,0002,453,504
3Mar 19, 2026 14:3623,404799,987,224761,342,00010,990,0002,457,600
4Mar 19, 2026 14:1423,428801,318,594766,126,0007,001,0002,347,008
5Mar 19, 2026 14:1423,464803,825,211765,330,0008,992,0002,306,048
6Mar 19, 2026 14:3624,109823,177,843789,614,0005,989,0002,461,696