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 03:04Victor MerckléVictor MerckléScore: 3,083Success
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 03:053,06892,069,777238,693,0003,149,0002,654,208
2Jun 24, 2026 03:053,07292,188,089240,045,0003,055,0002,654,208
3Jun 24, 2026 03:053,07292,184,963241,030,0002,048,0002,650,112
4Jun 24, 2026 03:053,08292,483,653240,511,0003,107,0002,654,208
5Jun 24, 2026 03:053,08392,493,690241,338,0003,146,0002,654,208
6Jun 24, 2026 03:053,08792,619,198241,744,0003,127,0002,650,112
7Jun 24, 2026 03:053,09292,777,685242,128,0003,168,0002,654,208
8Jun 24, 2026 03:053,20196,049,706245,541,0003,043,0002,654,208
9Jun 24, 2026 03:053,22596,778,614247,878,0003,100,0002,654,208