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 8, 2026 00:28anboto1anboto1Score: 11,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:2910,944370,493,901348,593,00012,578,0002,117,632
2Jun 8, 2026 00:2911,057374,166,642352,200,00012,697,0002,117,632
3Jun 8, 2026 00:2911,065374,470,678352,469,00012,702,0002,117,632
4Jun 8, 2026 00:2911,070376,531,501353,265,00012,058,0002,117,632
5Jun 8, 2026 00:2911,122376,324,968354,249,00012,789,0002,117,632
6Jun 8, 2026 00:2911,136376,825,624354,788,00012,722,0002,117,632
7Jun 8, 2026 00:2911,163377,741,585355,522,00012,876,0002,117,632
8Jun 8, 2026 00:2911,164377,730,010355,663,00012,759,0002,117,632
9Jun 8, 2026 00:2911,211379,240,130357,170,00012,824,0002,117,632