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:59marko1597marko1597Score: 9,159Success
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 05:279,121273,638,099253,326,00011,774,0002,121,728stderr
2Aug 17, 2026 05:279,125273,763,596253,741,00011,624,0002,121,728stderr
3Aug 17, 2026 05:279,152274,567,785254,153,00012,034,0002,121,728stderr
4Aug 17, 2026 05:279,156274,704,679254,622,00011,634,0002,121,728stderr
5Aug 17, 2026 05:279,159274,777,638254,614,00011,684,0002,121,728stderr
6Aug 17, 2026 05:279,162274,864,187254,552,00011,802,0002,121,728stderr
7Aug 17, 2026 05:279,166274,997,887254,820,00011,664,0002,121,728stderr
8Aug 17, 2026 05:279,199275,970,339254,579,00011,563,0002,121,728stderr
9Aug 17, 2026 05:279,275278,260,702257,807,00011,831,0002,121,728stderr