Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 9, 2026 08:51Karthik ReddyKarthik ReddyScore: 1,464Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 18:12Andrew Epstein37.53CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 10:001,44843,450,490101,569,0001,097,000319,488
2Oct 9, 2026 10:001,45243,564,377102,329,0001,008,000319,488
3Oct 9, 2026 10:001,45943,798,408102,942,0001,012,000319,488
4Oct 9, 2026 10:001,46243,860,107103,146,0001,004,000319,488
5Oct 9, 2026 10:001,46443,949,427103,297,0001,008,000319,488
6Oct 9, 2026 10:001,46543,963,971103,394,0001,007,000319,488
7Oct 9, 2026 10:001,46744,014,053103,527,0001,005,000319,488
8Oct 9, 2026 10:001,47544,253,392104,225,0001,005,000319,488
9Oct 9, 2026 10:001,49344,797,460105,942,0001,005,000319,488