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 6, 2026 13:52Victor MerckléVictor MerckléScore: 4,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 13:534,485134,556,342369,887,0004,643,0002,646,016
2Jun 6, 2026 13:534,502135,077,467370,333,0004,299,0002,641,920
3Jun 6, 2026 13:534,554136,632,234376,737,0004,496,0002,646,016
4Jun 6, 2026 13:534,568137,046,321375,457,0003,427,0002,650,112
5Jun 6, 2026 13:534,569137,097,467379,783,0004,363,0002,646,016
6Jun 6, 2026 13:534,613138,410,112381,199,0004,444,0002,646,016
7Jun 6, 2026 13:534,618138,542,160380,104,0004,112,0002,646,016
8Jun 6, 2026 13:534,659139,780,045384,008,0004,441,0002,641,920
9Jun 6, 2026 13:534,742142,288,962383,001,0004,284,0002,641,920