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:46marko1597marko1597Score: 8,618Success
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:488,584257,531,118242,927,0006,219,0002,121,728stderr
2Aug 17, 2026 06:488,585257,566,225242,773,0006,454,0002,121,728stderr
3Aug 17, 2026 06:488,591257,737,854243,155,0006,320,0002,121,728stderr
4Aug 17, 2026 06:488,616258,503,148243,607,0006,475,0002,121,728stderr
5Aug 17, 2026 06:488,618258,552,200244,099,0006,230,0002,121,728stderr
6Aug 17, 2026 06:488,620258,623,882244,090,0006,209,0002,121,728stderr
7Aug 17, 2026 06:488,632258,985,276244,349,0006,465,0002,121,728stderr
8Aug 17, 2026 06:488,659259,771,859243,592,0006,429,0002,121,728stderr
9Aug 17, 2026 06:488,987269,612,734254,814,0006,505,0002,121,728stderr