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 1, 2026 07:09Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 17:37Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 17:450360,343,977336,379,00013,054,0002,121,728expected "2902218 ", got "2497084 "
2Oct 31, 2026 17:450370,366,686347,519,00012,078,0002,117,632expected "2901176 ", got "2496042 "
3Oct 31, 2026 17:450369,477,717346,516,00012,155,0002,117,632expected "2901043 ", got "2495906 "
4Jan 1, 2026 07:0921,462741,947,575692,269,00015,983,0002,494,464
5Jan 1, 2026 07:0921,493738,037,566694,297,00014,984,0002,347,008
6Jan 1, 2026 07:0921,503734,841,757691,602,00017,989,0002,310,144