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 22, 2025 19:52Daniel MastalerzDaniel MastalerzScore: 86,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 19:5285,2442,849,497,3652,801,063,00011,991,0002,289,664
2Oct 22, 2025 19:5285,5092,852,515,5652,811,796,0009,995,0002,281,472
3Oct 22, 2025 19:5285,6082,850,005,9852,815,060,0009,993,0002,281,472
4Oct 22, 2025 19:5285,8822,862,070,6672,821,103,00012,991,0002,281,472
5Oct 22, 2025 19:5286,0082,864,406,1552,828,285,0009,993,0002,289,664
6Oct 22, 2025 19:5286,1042,866,553,3412,829,449,00011,993,0002,285,568
7Oct 22, 2025 19:5286,3682,878,648,4362,838,144,00011,992,0002,285,568
8Oct 22, 2025 19:5286,3962,890,827,5872,839,064,00011,991,0002,297,856
9Oct 22, 2025 19:5286,6442,888,561,0402,847,248,00011,992,0002,297,856