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 31, 2026 09:20Andrew EpsteinAndrew EpsteinScore: 1,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 09:301,53546,069,20699,875,0002,035,0002,183,168stderr
2Oct 31, 2026 09:301,54046,210,587100,612,0002,020,0002,179,072stderr
3Oct 31, 2026 09:301,54546,374,885100,482,0002,036,0002,183,168stderr
4Oct 31, 2026 09:301,54546,362,136100,983,0002,026,0002,183,168stderr
5Oct 31, 2026 09:301,54646,404,589100,916,0002,019,0002,179,072stderr
6Oct 31, 2026 09:301,55146,539,755101,383,0002,044,0002,179,072stderr
7Oct 31, 2026 09:301,56747,032,930102,644,0002,038,0002,183,168stderr
8Oct 31, 2026 09:301,56947,076,042102,149,0002,025,0002,179,072stderr
9Oct 31, 2026 09:301,59447,826,607105,519,0002,048,0002,224,128stderr