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 10, 2026 21:56Victor MerckléVictor MerckléScore: 36,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 21:5936,1871,085,625,9891,066,161,0009,867,0002,195,456
2Jun 10, 2026 21:5936,2951,088,861,1131,069,678,00010,231,0002,195,456
3Jun 10, 2026 21:5936,3071,089,219,7281,071,557,0009,208,0002,195,456
4Jun 10, 2026 21:5936,3371,090,134,3131,069,768,0009,351,0002,195,456
5Jun 10, 2026 21:5936,3541,090,628,0771,069,365,00010,553,0002,158,592
6Jun 10, 2026 21:5936,3681,091,059,0281,073,099,0009,398,0002,211,840
7Jun 10, 2026 21:5936,3991,091,971,0721,071,478,0009,134,0002,174,976
8Jun 10, 2026 21:5936,4091,092,297,6821,072,216,0009,692,0002,195,456
9Jun 10, 2026 21:5936,5491,096,477,4081,075,669,0009,937,0002,174,976