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 14, 2026 21:01Tomislav TunkovicTomislav TunkovicScore: 2,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 21:112,88486,529,614214,700,00011,952,0002,162,688
2Aug 14, 2026 21:112,90887,264,878218,600,00011,240,0002,162,688
3Aug 14, 2026 21:112,91587,477,684217,574,00011,113,0002,162,688
4Aug 14, 2026 21:112,92087,619,919216,450,00011,788,0002,162,688
5Aug 14, 2026 21:112,92287,665,168220,758,00011,684,0002,162,688
6Aug 14, 2026 21:112,95388,596,170215,418,00011,962,0002,154,496
7Aug 14, 2026 21:112,98189,451,716219,474,00010,745,0002,154,496
8Aug 14, 2026 21:112,98489,521,464225,910,00011,231,0002,162,688
9Aug 14, 2026 21:113,01590,450,692221,234,00012,936,0002,150,400