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 18, 2026 04:29Josu San MartinJosu San MartinScore: 4,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:364,694140,831,188196,744,0003,247,0002,158,592
2Aug 18, 2026 04:364,701141,046,931196,636,0003,225,0002,158,592
3Aug 18, 2026 04:364,706141,193,983196,317,0003,239,0002,158,592
4Aug 18, 2026 04:364,709141,295,903196,371,0003,201,0002,158,592
5Aug 18, 2026 04:364,717141,539,042197,051,0003,202,0002,158,592
6Aug 18, 2026 04:364,718141,564,043196,313,0003,216,0002,158,592
7Aug 18, 2026 04:364,719141,571,205196,554,0003,220,0002,158,592
8Aug 18, 2026 04:364,722141,664,731197,099,0003,278,0002,158,592
9Aug 18, 2026 04:364,723141,691,064196,309,0003,253,0002,158,592