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 listAug 15, 2026 13:38Tomislav TunkovicTomislav TunkovicScore: 2,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 13:392,78283,488,525210,659,00011,594,00065,536
2Aug 15, 2026 13:392,82284,686,053210,154,00011,342,00065,536
3Aug 15, 2026 13:392,85185,544,319215,235,00011,694,00065,536
4Aug 15, 2026 13:392,87386,210,480215,637,00011,488,00065,536
5Aug 15, 2026 13:392,88186,432,847212,414,00012,645,00061,440
6Aug 15, 2026 13:392,95188,530,955216,286,00011,587,00061,440
7Aug 15, 2026 13:392,96088,800,165219,313,00011,163,00061,440
8Aug 15, 2026 13:392,97289,186,891217,540,00011,352,00061,440
9Aug 15, 2026 13:393,00490,139,352223,419,00010,719,00065,536