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:53olliecrowolliecrowScore: 11,180Success
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:5310,888326,633,679851,192,0009,990,0002,670,592
2Mar 3, 2026 23:5310,958328,728,860856,242,00010,990,0002,768,896
3Mar 3, 2026 23:5311,000329,993,362860,376,0009,992,0002,703,360
4Mar 3, 2026 23:5311,045331,345,263859,859,0008,988,0002,400,256
5Mar 3, 2026 23:5311,180335,413,327885,169,00010,977,0002,412,544
6Mar 3, 2026 23:5311,234337,023,256887,372,0009,981,0002,666,496
7Mar 3, 2026 23:5311,265337,939,844883,202,0009,990,0002,408,448
8Mar 3, 2026 23:5311,271338,131,425856,819,0009,986,0002,674,688
9Mar 3, 2026 23:5311,482344,469,934888,561,0009,983,0002,666,496