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 listJan 10, 2026 01:45Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:13Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:18020,020,805,56520,003,947,0005,285,00016,384Killed by timeout
2Jan 10, 2026 01:455,611208,987,349181,151,0004,003,0002,465,792
3Jan 10, 2026 01:455,611208,337,264181,165,0004,003,0002,277,376
4Jan 10, 2026 01:455,616211,881,266183,339,0002,003,0002,379,776
5Jan 10, 2026 01:455,627213,057,469182,687,0002,994,0002,383,872
6Jan 10, 2026 01:455,631207,639,266183,828,0001,998,0002,502,656
7Jan 10, 2026 01:455,636207,589,811181,979,0003,999,0002,371,584
8Jan 10, 2026 01:455,656218,234,605182,660,0003,992,0002,367,488
9Jan 10, 2026 01:455,657209,909,161184,681,0001,996,0002,510,848
10Jan 10, 2026 01:455,713215,432,848184,536,0003,989,0002,277,376