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 19:28Dominique GarmierDominique GarmierScore: 20,164Success
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 19:2720,075688,994,171653,481,0008,992,0002,457,600
2Mar 19, 2026 19:2720,110688,907,925654,650,0008,995,0002,465,792
3Mar 19, 2026 19:2820,155697,026,257656,118,0009,001,0002,404,352
4Mar 19, 2026 19:2820,164692,671,217658,404,0006,993,0002,347,008
5Mar 19, 2026 19:2820,194691,281,258655,401,00010,989,0002,260,992
6Mar 19, 2026 19:2720,598710,100,851670,746,0008,996,0002,371,584