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 04:26marko1597marko1597Score: 9,931Success
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:489,910297,324,076277,269,00011,707,0002,121,728stderr
2Aug 17, 2026 04:489,922297,664,846277,237,00012,094,0002,121,728stderr
3Aug 17, 2026 04:489,924297,739,591277,573,00011,784,0002,121,728stderr
4Aug 17, 2026 04:489,926297,782,452277,310,00012,018,0002,121,728stderr
5Aug 17, 2026 04:489,931297,937,036277,836,00011,771,0002,121,728stderr
6Aug 17, 2026 04:489,947298,411,499279,358,00010,701,0002,121,728stderr
7Aug 17, 2026 04:489,955298,652,982277,756,00011,747,0002,121,728stderr
8Aug 17, 2026 04:489,955298,664,187277,435,00011,653,0002,121,728stderr
9Aug 17, 2026 04:4810,499314,987,566295,000,00011,674,0002,121,728stderr