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 00:30Victor MerckléVictor MerckléScore: 4,030Success
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 00:313,473104,217,916258,541,0003,140,0002,637,824
2Jun 26, 2026 00:313,493104,792,686258,763,0003,170,0002,637,824
3Jun 26, 2026 00:313,496104,891,862259,058,0003,114,0002,637,824
4Jun 26, 2026 00:313,501105,046,600272,474,0003,108,0002,637,824
5Jun 26, 2026 00:314,030120,928,887290,793,0003,162,0002,637,824
6Jun 26, 2026 00:314,049121,480,971291,003,0003,138,0002,637,824
7Jun 26, 2026 00:314,072122,181,118304,747,0003,098,0002,633,728
8Jun 26, 2026 00:314,154124,646,116296,198,0003,063,0002,637,824
9Jun 26, 2026 00:314,223126,719,977280,434,0003,067,0002,637,824