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:44Victor MerckléVictor MerckléScore: 3,655Success
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:453,356100,683,982268,772,0001,030,0002,654,208
2Jun 17, 2026 23:453,448103,450,103271,918,0001,005,0002,650,112
3Jun 17, 2026 23:453,595107,874,460291,215,0001,031,0002,654,208
4Jun 17, 2026 23:453,597107,927,653291,805,0001,010,0002,654,208
5Jun 17, 2026 23:453,655109,661,510294,076,0003,052,0002,650,112
6Jun 17, 2026 23:453,900117,016,593301,617,0001,030,0002,654,208
7Jun 17, 2026 23:453,936118,083,587318,885,0001,033,0002,654,208
8Jun 17, 2026 23:453,969119,080,279323,030,0001,035,0002,654,208
9Jun 17, 2026 23:453,976119,296,334319,390,0003,033,0002,654,208