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 listJun 7, 2026 18:18anboto1anboto1Score: 22,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:1921,914732,606,125716,545,0006,648,0002,113,536
2Jun 7, 2026 18:1921,957733,909,615717,849,0006,735,0002,113,536
3Jun 7, 2026 18:1922,129739,643,352723,510,0006,772,0002,113,536
4Jun 7, 2026 18:1922,286745,152,974728,768,0006,690,0002,113,536
5Jun 7, 2026 18:1922,288746,254,835728,737,0006,783,0002,113,536
6Jun 7, 2026 18:1922,386748,630,968731,808,0006,955,0002,113,536
7Jun 7, 2026 18:1923,048769,930,127753,685,0006,916,0002,113,536
8Jun 7, 2026 18:1923,167774,341,597757,633,0006,901,0002,113,536
9Jun 7, 2026 18:1923,195774,648,920758,284,0007,155,0002,113,536