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:22marko1597marko1597Score: 8,879Success
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:288,839265,180,828250,478,0006,433,0002,121,728stderr
2Aug 17, 2026 06:288,856265,701,973251,082,0006,362,0002,121,728stderr
3Aug 17, 2026 06:288,861265,853,943251,194,0006,368,0002,121,728stderr
4Aug 17, 2026 06:288,877266,323,437251,756,0006,203,0002,121,728stderr
5Aug 17, 2026 06:288,879266,395,554251,915,0006,246,0002,121,728stderr
6Aug 17, 2026 06:288,882266,481,722252,028,0006,278,0002,121,728stderr
7Aug 17, 2026 06:288,886266,594,513251,963,0006,277,0002,121,728stderr
8Aug 17, 2026 06:288,955268,658,549254,183,0006,205,0002,121,728stderr
9Aug 17, 2026 06:289,007270,224,300255,618,0006,213,0002,121,728stderr