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 03:42marko1597marko1597Score: 14,787Success
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 04:0814,730441,925,176422,980,00010,497,0002,121,728stderr
2Aug 17, 2026 04:0814,735442,068,793423,119,00010,502,0002,121,728stderr
3Aug 17, 2026 04:0814,741442,249,155423,084,00010,703,0002,121,728stderr
4Aug 17, 2026 04:0814,773443,198,856424,259,00010,601,0002,121,728stderr
5Aug 17, 2026 04:0814,787443,614,656424,855,00010,547,0002,121,728stderr
6Aug 17, 2026 04:0814,791443,739,340424,577,00010,694,0002,121,728stderr
7Aug 17, 2026 04:0814,812444,377,441424,681,00011,313,0002,121,728stderr
8Aug 17, 2026 04:0814,817444,530,978425,563,00010,518,0002,121,728stderr
9Aug 17, 2026 04:0814,913447,404,851427,566,00011,315,0002,121,728stderr