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 24, 2026 04:46Victor MerckléVictor MerckléScore: 3,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 04:463,32499,736,827259,919,0003,096,0002,646,016
2Jun 24, 2026 04:463,32599,754,670260,432,0003,060,0002,646,016
3Jun 24, 2026 04:463,33099,926,436260,971,0003,122,0002,646,016
4Jun 24, 2026 04:463,339100,173,764261,250,0003,081,0002,646,016
5Jun 24, 2026 04:463,339100,184,462260,789,0003,140,0002,646,016
6Jun 24, 2026 04:463,363100,906,964262,344,0003,157,0002,646,016
7Jun 24, 2026 04:463,387101,624,155265,172,0003,126,0002,646,016
8Jun 24, 2026 04:463,439103,181,629266,483,0003,117,0002,641,920
9Jun 24, 2026 04:463,470104,120,739267,410,0003,099,0002,646,016