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 27, 2026 21:02Victor MerckléVictor MerckléScore: 4,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 21:034,437154,249,977145,209,0001,238,0002,113,536
2Jun 27, 2026 21:034,438154,178,167145,314,0001,165,0002,113,536
3Jun 27, 2026 21:034,439154,637,350145,312,0001,190,0002,113,536
4Jun 27, 2026 21:034,457155,048,896145,905,0001,179,0002,113,536
5Jun 27, 2026 21:034,461154,933,104146,045,0001,173,0002,113,536
6Jun 27, 2026 21:034,471155,276,363146,422,0001,145,0002,113,536
7Jun 27, 2026 21:034,480155,907,570146,650,0001,193,0002,113,536
8Jun 27, 2026 21:034,480155,668,729146,735,0001,116,0002,113,536
9Jun 27, 2026 21:034,482155,759,707146,728,0001,180,0002,113,536