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 24, 2026 09:01Victor MerckléVictor MerckléScore: 1,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:021,68050,408,112118,083,0001,006,0002,170,880stderr
2Aug 24, 2026 09:021,69750,912,914120,643,0001,017,0002,170,880stderr
3Aug 24, 2026 09:021,70251,064,570121,113,0001,020,0002,170,880stderr
4Aug 24, 2026 09:021,72351,697,756123,689,0002,026,0002,170,880stderr
5Aug 24, 2026 09:021,72451,743,915122,146,0001,016,0002,170,880stderr
6Aug 24, 2026 09:021,72751,837,730121,505,0001,030,0002,170,880stderr
7Aug 24, 2026 09:021,73452,022,516121,256,0001,024,0002,170,880stderr
8Aug 24, 2026 09:021,79853,951,123121,340,0001,030,0002,170,880stderr
9Aug 24, 2026 09:021,81254,366,300123,279,0002,070,0002,174,976stderr