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 listAug 14, 2026 21:18Tomislav TunkovicTomislav TunkovicScore: 3,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 21:222,84185,233,574216,619,00010,773,0002,162,688
2Aug 14, 2026 21:222,84785,410,699213,903,00012,193,0002,162,688
3Aug 14, 2026 21:222,89986,981,578212,621,00011,711,0002,150,400
4Aug 14, 2026 21:222,92387,703,880220,612,00010,699,0002,162,688
5Aug 14, 2026 21:223,01490,435,917223,412,00011,175,0002,154,496
6Aug 14, 2026 21:223,01890,563,390221,952,00012,263,0002,166,784
7Aug 14, 2026 21:223,02790,812,367220,595,00010,779,0002,154,496
8Aug 14, 2026 21:223,03891,144,220220,492,00010,974,0002,154,496
9Aug 14, 2026 21:223,03991,182,413229,092,00010,762,0002,162,688