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 20:41Victor MerckléVictor MerckléScore: 3,391Success
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 20:423,380119,434,685110,476,0001,094,0002,113,536
2Jun 27, 2026 20:423,381119,284,037110,491,0001,098,0002,113,536
3Jun 27, 2026 20:423,383119,612,736110,552,0001,099,0002,113,536
4Jun 27, 2026 20:423,385119,526,255110,664,0001,058,0002,113,536
5Jun 27, 2026 20:423,391119,686,919110,738,0001,178,0002,113,536
6Jun 27, 2026 20:423,393119,829,666110,811,0001,182,0002,113,536
7Jun 27, 2026 20:423,395120,006,696110,918,0001,124,0002,113,536
8Jun 27, 2026 20:423,396119,906,766110,996,0001,095,0002,113,536
9Jun 27, 2026 20:423,397119,878,701110,962,0001,141,0002,113,536