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 22:22Tomislav TunkovicTomislav TunkovicScore: 3,435Success
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 22:233,357100,712,800255,180,00010,683,0002,154,496
2Aug 14, 2026 22:233,362100,868,465257,313,00011,208,0002,162,688
3Aug 14, 2026 22:233,374101,225,235258,773,00010,937,0002,162,688
4Aug 14, 2026 22:233,376101,305,013260,064,00011,717,0002,162,688
5Aug 14, 2026 22:233,435103,068,447258,413,00010,660,0002,154,496
6Aug 14, 2026 22:233,435103,069,942265,312,00011,345,0002,162,688
7Aug 14, 2026 22:233,443103,312,402260,003,00011,331,0002,154,496
8Aug 14, 2026 22:233,447103,412,817265,111,00011,178,0002,162,688
9Aug 14, 2026 22:233,493104,813,821262,361,00011,152,0002,162,688