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 listJun 11, 2026 15:42Victor MerckléVictor MerckléScore: 3,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 15:433,11893,563,077243,799,0003,124,0002,654,208
2Jun 11, 2026 15:433,12793,838,997246,836,0001,006,0002,646,016
3Jun 11, 2026 15:433,12793,836,735246,744,0001,028,0002,650,112
4Jun 11, 2026 15:433,12793,811,712245,788,0003,057,0002,654,208
5Jun 11, 2026 15:433,13293,987,009245,130,0003,118,0002,654,208
6Jun 11, 2026 15:433,13794,113,162245,651,0003,078,0002,654,208
7Jun 11, 2026 15:433,15294,583,207247,126,0003,054,0002,654,208
8Jun 11, 2026 15:433,15594,651,397247,335,0003,126,0002,654,208
9Jun 11, 2026 15:433,20196,038,353245,539,0003,053,0002,646,016