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 11, 2026 15:16Victor MerckléVictor MerckléScore: 5,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 15:175,535166,061,955311,876,0003,086,0002,658,304
2Jun 11, 2026 15:175,571167,141,522312,725,0004,213,0002,654,208
3Jun 11, 2026 15:175,573167,201,384313,673,0003,179,0002,654,208
4Jun 11, 2026 15:175,579167,373,440313,407,0003,140,0002,658,304
5Jun 11, 2026 15:175,583167,505,961318,956,0001,043,0002,654,208
6Jun 11, 2026 15:175,583167,499,138316,145,0003,165,0002,658,304
7Jun 11, 2026 15:175,603168,092,732312,520,0004,737,0002,654,208
8Jun 11, 2026 15:175,800174,018,944324,733,0003,146,0002,654,208
9Jun 11, 2026 15:175,808174,249,550324,886,0003,151,0002,654,208