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 17, 2026 23:39Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:400116,576,831314,606,0003,120,0002,654,208expected "1019509 ", got "1019508 "
2Jun 17, 2026 23:403,401102,054,720272,103,0001,044,0002,654,208
3Jun 17, 2026 23:403,404102,120,930270,062,0003,123,0002,654,208
4Jun 17, 2026 23:403,616108,502,314289,150,0003,146,0002,654,208
5Jun 17, 2026 23:403,658109,746,904293,905,0003,077,0002,654,208
6Jun 17, 2026 23:403,961118,859,841322,721,0001,003,0002,654,208
7Jun 17, 2026 23:403,983119,506,978319,226,0003,031,0002,654,208
8Jun 17, 2026 23:403,986119,590,640318,191,0003,032,0002,650,112
9Jun 17, 2026 23:403,991119,740,831320,298,0002,049,0002,654,208