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 listJul 31, 2026 13:46CodeReclaimersCodeReclaimersScore: 9,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:479,266316,534,499269,453,00036,330,0002,113,536
2Jul 31, 2026 13:479,269316,010,800269,133,00036,751,0002,113,536
3Jul 31, 2026 13:479,290317,449,724269,715,00036,884,0002,113,536
4Jul 31, 2026 13:479,303317,931,920269,377,00037,629,0002,113,536
5Jul 31, 2026 13:479,310317,374,683270,427,00036,806,0002,113,536
6Jul 31, 2026 13:479,349319,509,114271,624,00036,896,0002,113,536
7Jul 31, 2026 13:479,373320,150,064272,519,00036,804,0002,113,536
8Jul 31, 2026 13:479,375320,268,530271,641,00037,753,0002,113,536
9Jul 31, 2026 13:479,421321,026,293273,320,00037,599,0002,113,536