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 listMar 29, 2026 05:24Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 17:23Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 17:25020,020,576,81020,007,647,0002,015,00016,384Killed by timeout
2Mar 29, 2026 05:2413,432467,856,293442,270,0001,000,0002,306,048
3Mar 29, 2026 05:2413,563474,307,932444,586,0002,997,0002,453,504
4Mar 29, 2026 05:2413,575476,472,143442,979,0004,999,0002,424,832
5Mar 29, 2026 05:2413,612477,695,491446,190,0003,001,0002,277,376
6Mar 29, 2026 05:2413,715477,236,964447,584,0004,995,0002,469,888
7Mar 29, 2026 05:2413,742475,244,917448,484,0004,994,0002,457,600
8Mar 29, 2026 05:2413,745481,222,365448,587,0004,995,0002,277,376
9Mar 29, 2026 05:2413,770483,019,642451,420,0002,996,0002,457,600
10Mar 29, 2026 05:2413,843482,454,152450,807,0005,997,0002,449,408