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 listOct 17, 2026 21:33e1011e1011Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:21Andrew Epstein16.97CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 16:25020,022,298,33719,998,240,00012,734,00016,384Killed by timeout
2Oct 17, 2026 21:3718,385617,908,180593,193,00013,540,0002,113,536
3Oct 17, 2026 21:3718,477620,794,513596,375,00013,398,0002,113,536
4Oct 17, 2026 21:3718,479621,058,278596,273,00013,539,0002,113,536
5Oct 17, 2026 21:3718,489621,220,103596,607,00013,558,0002,113,536
6Oct 17, 2026 21:3718,506622,289,119597,070,00013,636,0002,113,536
7Oct 17, 2026 21:3718,561624,225,386599,025,00013,516,0002,113,536
8Oct 17, 2026 21:3718,564623,747,865599,029,00013,595,0002,113,536
9Oct 17, 2026 21:3718,630625,854,417601,357,00013,461,0002,113,536
10Oct 17, 2026 21:3718,697628,499,943603,442,00013,562,0002,113,536