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 26, 2026 23:42Victor 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 26, 2026 23:43085,895,327230,096,0003,089,0002,654,208expected "1025092 ", got "1025091 "
2Jun 26, 2026 23:432,85085,513,658230,926,0001,019,0002,658,304
3Jun 26, 2026 23:432,85485,641,030229,365,0003,080,0002,654,208
4Jun 26, 2026 23:432,86786,030,755230,335,0003,162,0002,658,304
5Jun 26, 2026 23:432,87186,155,987228,931,0003,149,0002,658,304
6Jun 26, 2026 23:432,93087,905,104232,491,0003,071,0002,654,208
7Jun 26, 2026 23:432,93287,968,626232,980,0002,067,0002,658,304
8Jun 26, 2026 23:432,98089,403,720233,626,0003,087,0002,654,208
9Jun 26, 2026 23:432,98589,556,141237,390,0002,095,0002,658,304