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 listOct 24, 2026 19:56janwwwjanwwwScore: 5,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 19:575,468164,054,120439,861,0003,238,0002,170,880
2Oct 24, 2026 19:575,498164,959,786442,199,0004,237,0002,170,880
3Oct 24, 2026 19:575,518165,558,917443,807,0003,177,0002,170,880
4Oct 24, 2026 19:575,546166,404,922447,707,0003,169,0002,170,880
5Oct 24, 2026 19:575,547166,418,912449,130,0004,224,0002,170,880
6Oct 24, 2026 19:575,570167,115,739448,820,0004,205,0002,170,880
7Oct 24, 2026 19:575,576167,292,201450,896,0004,159,0002,170,880
8Oct 24, 2026 19:575,645169,351,197456,035,0004,156,0002,170,880
9Oct 24, 2026 19:575,647169,430,980453,410,0004,195,0002,170,880