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 listJun 26, 2026 01:26Victor MerckléVictor MerckléScore: 5,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 01:275,106153,185,980374,813,0003,184,0002,633,728
2Jun 26, 2026 01:275,107153,234,462376,809,0002,117,0002,637,824
3Jun 26, 2026 01:275,131153,942,896377,738,0003,115,0002,633,728
4Jun 26, 2026 01:275,136154,083,043378,978,0003,187,0002,633,728
5Jun 26, 2026 01:275,172155,162,793379,602,0003,163,0002,637,824
6Jun 26, 2026 01:275,175155,259,667379,045,0003,211,0002,637,824
7Jun 26, 2026 01:275,203156,102,243380,633,0003,108,0002,637,824
8Jun 26, 2026 01:275,209156,291,633383,879,0002,190,0002,633,728
9Jun 26, 2026 01:275,224156,739,263380,948,0003,109,0002,637,824