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:34marko1597marko1597Score: 8,720Success
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:358,683260,493,830246,041,0006,203,0002,121,728stderr
2Aug 17, 2026 06:358,696260,902,407246,415,0006,206,0002,121,728stderr
3Aug 17, 2026 06:358,698260,965,236246,325,0006,383,0002,121,728stderr
4Aug 17, 2026 06:358,702261,074,134246,139,0006,366,0002,121,728stderr
5Aug 17, 2026 06:358,720261,602,105246,832,0006,384,0002,121,728stderr
6Aug 17, 2026 06:358,730261,916,817246,784,0006,429,0002,121,728stderr
7Aug 17, 2026 06:358,736262,106,225246,709,0006,353,0002,121,728stderr
8Aug 17, 2026 06:358,741262,231,005246,774,0006,354,0002,121,728stderr
9Aug 17, 2026 06:358,754262,634,515246,821,0006,208,0002,121,728stderr