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 04:59marko1597marko1597Score: 9,337Success
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 05:229,323279,702,757259,422,00011,999,0002,121,728stderr
2Aug 17, 2026 05:229,326279,793,967259,558,00011,987,0002,121,728stderr
3Aug 17, 2026 05:229,328279,861,641259,827,00011,670,0002,121,728stderr
4Aug 17, 2026 05:229,333280,002,307259,761,00012,063,0002,121,728stderr
5Aug 17, 2026 05:229,337280,114,461260,113,00011,685,0002,121,728stderr
6Aug 17, 2026 05:229,352280,581,762260,525,00011,706,0002,121,728stderr
7Aug 17, 2026 05:229,354280,622,592260,775,00011,661,0002,121,728stderr
8Aug 17, 2026 05:229,355280,675,096259,834,00011,689,0002,121,728stderr
9Aug 17, 2026 05:229,368281,049,495259,390,00011,988,0002,121,728stderr