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 16, 2026 08:23M-RochatM-RochatScore: 50,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:2449,4851,645,655,5371,620,436,00012,594,0002,113,536
2May 16, 2026 08:2450,0191,659,894,3231,637,946,00012,692,0002,113,536
3May 16, 2026 08:2450,0621,664,146,1061,639,168,00012,879,0002,113,536
4May 16, 2026 08:2450,2691,670,024,9171,645,659,00013,222,0002,113,536
5May 16, 2026 08:2450,7601,684,533,9621,662,360,00012,746,0002,113,536
6May 16, 2026 08:2450,9921,693,867,8931,669,592,00013,155,0002,113,536
7May 16, 2026 08:2451,9461,724,412,9701,701,527,00012,715,0002,113,536
8May 16, 2026 08:2452,3071,737,144,7711,713,042,00013,101,0002,113,536
9May 16, 2026 08:2452,6371,747,228,6211,723,841,00013,199,0002,113,536