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 listMay 4, 2026 21:50olliecrowolliecrowScore: 12,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:5112,650379,515,976352,460,0009,019,0002,416,640
2May 4, 2026 21:5112,675380,252,768355,123,0008,947,0002,437,120
3May 4, 2026 21:5112,843385,292,428358,376,0009,667,0002,428,928
4May 4, 2026 21:5112,843385,301,102359,690,0009,241,0002,400,256
5May 4, 2026 21:5112,894386,841,348359,039,0009,061,0002,424,832
6May 4, 2026 21:5112,944388,334,634361,920,0009,192,0002,420,736
7May 4, 2026 21:5112,956388,700,948360,854,0009,368,0002,416,640
8May 4, 2026 21:5113,093392,796,408366,234,0009,563,0002,408,448
9May 4, 2026 21:5113,182395,470,745366,300,0009,432,0002,428,928