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 02:48Andrew EpsteinAndrew EpsteinScore: 1,550Success
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 02:541,51345,404,983102,544,0003,155,0002,170,880
2Oct 31, 2026 02:541,51945,596,410105,288,0001,135,0002,170,880
3Oct 31, 2026 02:541,52045,620,140105,266,0001,027,0002,162,688
4Oct 31, 2026 02:541,53546,055,927106,234,0001,026,0002,162,688
5Oct 31, 2026 02:541,55046,528,063107,915,0001,025,0002,170,880
6Oct 31, 2026 02:541,56647,003,941107,537,0001,023,0002,170,880
7Oct 31, 2026 02:541,56947,084,130109,404,0001,292,0002,170,880
8Oct 31, 2026 02:541,59747,935,998107,072,0001,254,0002,162,688
9Oct 31, 2026 02:541,60348,099,497106,749,0001,015,0002,162,688