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 listNov 21, 2025 03:04izotoffizotoffScore: 30,970Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 03:0430,367910,998,955869,732,0007,005,0002,641,920
2Nov 21, 2025 01:3630,767922,998,780886,617,0005,997,0002,461,696
3Nov 21, 2025 01:3630,897926,899,578891,048,0008,000,0002,383,872
4Nov 21, 2025 01:3630,970929,103,714893,826,0006,005,0002,392,064
5Nov 21, 2025 03:0431,062931,848,616894,247,0006,008,0002,392,064
6Nov 21, 2025 03:0431,183935,485,470901,224,0006,993,0002,637,824