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 listApr 21, 2026 17:11olliecrowolliecrowScore: 6,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:146,427192,819,932491,575,00012,962,0002,580,480
2Apr 21, 2026 17:146,435193,065,142498,962,0009,999,0002,752,512
3Apr 21, 2026 17:146,492194,767,059492,840,00011,971,0002,772,992
4Apr 21, 2026 17:146,561196,858,350499,192,00010,023,0002,449,408
5Apr 21, 2026 17:146,598197,958,037493,736,00010,014,0002,740,224
6Apr 21, 2026 17:146,603198,108,196495,864,0008,997,0002,600,960
7Apr 21, 2026 17:146,643199,294,909493,076,00011,001,0002,686,976
8Apr 21, 2026 17:146,757202,722,685494,882,0009,977,0002,678,784
9Apr 21, 2026 17:146,854205,644,001502,383,0007,990,0002,449,408