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 listMar 3, 2026 23:04olliecrowolliecrowScore: 12,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:0412,300368,992,952922,808,00020,972,0003,026,944
2Mar 3, 2026 23:0412,435373,046,326920,593,00020,967,0002,732,032
3Mar 3, 2026 23:0412,503375,097,556926,875,00020,974,0002,990,080
4Mar 3, 2026 23:0412,635379,047,644939,746,00020,972,0002,994,176
5Mar 3, 2026 23:0412,662379,860,119939,340,00022,959,0002,727,936
6Mar 3, 2026 23:0412,723381,683,662922,725,00020,993,0002,842,624
7Mar 3, 2026 23:0412,753382,577,540922,941,00022,973,0002,990,080
8Mar 3, 2026 23:0412,876386,275,174940,256,00021,935,0002,990,080
9Mar 3, 2026 23:0413,030390,898,249933,490,00021,964,0003,014,656