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 17, 2026 06:01marko1597marko1597Score: 11,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 06:0611,572347,166,957326,824,00011,982,0002,121,728stderr
2Aug 17, 2026 06:0611,577347,312,046326,892,00011,926,0002,121,728stderr
3Aug 17, 2026 06:0611,583347,501,294327,363,00011,789,0002,121,728stderr
4Aug 17, 2026 06:0611,586347,582,108327,556,00011,684,0002,121,728stderr
5Aug 17, 2026 06:0611,589347,697,106326,521,00012,046,0002,121,728stderr
6Aug 17, 2026 06:0611,591347,755,495327,414,00011,965,0002,121,728stderr
7Aug 17, 2026 06:0611,595347,865,834327,710,00011,753,0002,121,728stderr
8Aug 17, 2026 06:0611,603348,092,579327,988,00011,774,0002,121,728stderr
9Aug 17, 2026 06:0611,621348,638,724328,453,00011,800,0002,121,728stderr