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 listAug 18, 2026 04:50Josu San MartinJosu San MartinScore: 4,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:514,663139,899,424196,697,0002,229,0002,146,304
2Aug 18, 2026 04:514,683140,504,168196,269,0003,211,0002,146,304
3Aug 18, 2026 04:514,686140,586,560196,562,0003,222,0002,146,304
4Aug 18, 2026 04:514,704141,146,959197,235,0002,236,0002,146,304
5Aug 18, 2026 04:514,706141,203,209196,223,0003,216,0002,146,304
6Aug 18, 2026 04:514,716141,483,461196,196,0003,237,0002,146,304
7Aug 18, 2026 04:514,735142,061,123197,339,0003,214,0002,142,208
8Aug 18, 2026 04:514,737142,129,811197,360,0003,239,0002,142,208
9Aug 18, 2026 04:514,880146,405,988199,293,0003,231,0002,125,824