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 listMay 3, 2026 21:04TudyMTudyMScore: 26,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 21:0726,238882,496,526832,679,00033,199,0002,363,392
2May 3, 2026 21:0726,403890,059,597837,147,00034,154,0002,371,584
3May 3, 2026 21:0726,429890,307,849838,995,00033,185,0002,355,200
4May 3, 2026 21:0726,439892,338,615839,103,00033,394,0002,363,392
5May 3, 2026 21:0726,443889,905,508838,670,00033,981,0002,355,200
6May 3, 2026 21:0726,624894,797,715844,461,00034,146,0002,359,296
7May 3, 2026 21:0726,628894,373,500844,762,00033,990,0002,371,584
8May 3, 2026 21:0726,670899,397,968845,948,00034,194,0002,351,104
9May 3, 2026 21:0727,136913,297,345861,732,00033,765,0002,367,488