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 9, 2026 23:31Victor MerckléVictor MerckléScore: 3,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:323,16194,839,837248,782,0001,061,0002,142,208
2Jun 9, 2026 23:323,17095,112,444247,058,0002,080,0002,138,112
3Jun 9, 2026 23:323,17495,241,515248,644,0001,077,0002,138,112
4Jun 9, 2026 23:323,19095,701,984249,124,0002,112,0002,138,112
5Jun 9, 2026 23:323,19495,832,500250,494,0002,091,0002,142,208
6Jun 9, 2026 23:323,20596,156,481249,510,0002,203,0002,142,208
7Jun 9, 2026 23:323,21596,459,799251,063,0002,107,0002,138,112
8Jun 9, 2026 23:323,21996,585,835251,437,0002,114,0002,134,016
9Jun 9, 2026 23:323,23196,947,786252,217,0002,083,0002,142,208