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 listJun 27, 2026 19:03Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 12:24Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 12:31020,010,914,66420,001,337,0001,084,00016,384Killed by timeout
2Jun 27, 2026 19:043,460121,884,522113,149,0001,047,0002,113,536
3Jun 27, 2026 19:043,462122,001,140113,169,0001,083,0002,113,536
4Jun 27, 2026 19:043,463121,953,386113,196,0001,083,0002,113,536
5Jun 27, 2026 19:043,464122,076,640113,293,0001,019,0002,113,536
6Jun 27, 2026 19:043,471122,184,796113,446,0001,098,0002,113,536
7Jun 27, 2026 19:043,473122,427,570113,547,0001,092,0002,113,536
8Jun 27, 2026 19:043,480122,555,244113,773,0001,092,0002,113,536
9Jun 27, 2026 19:043,480122,736,217113,778,0001,092,0002,113,536
10Jun 27, 2026 19:043,505123,286,733114,572,0001,093,0002,113,536