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:01marko1597marko1597Score: 10,102Success
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:0510,036301,084,556280,947,00011,885,0002,121,728stderr
2Aug 17, 2026 06:0510,043301,316,014280,982,00012,068,0002,121,728stderr
3Aug 17, 2026 06:0510,046301,404,013281,388,00011,720,0002,121,728stderr
4Aug 17, 2026 06:0510,085302,578,343282,422,00011,936,0002,121,728stderr
5Aug 17, 2026 06:0510,102303,076,949283,132,00011,698,0002,121,728stderr
6Aug 17, 2026 06:0510,126303,809,500283,718,00011,753,0002,121,728stderr
7Aug 17, 2026 06:0510,135304,069,904284,071,00011,777,0002,121,728stderr
8Aug 17, 2026 06:0510,152304,566,726284,438,00011,774,0002,121,728stderr
9Aug 17, 2026 06:0510,160304,808,135284,344,00012,045,0002,121,728stderr