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 18, 2026 17:03Victor MerckléVictor MerckléScore: 3,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 17:043,06892,056,239241,999,0001,023,0002,654,208
2Jun 18, 2026 17:043,08292,476,759242,938,0001,190,0002,654,208
3Jun 18, 2026 17:043,08392,491,722240,429,0003,114,0002,654,208
4Jun 18, 2026 17:043,08592,568,861241,306,0001,018,0002,654,208
5Jun 18, 2026 17:043,08692,596,506241,148,0003,123,0002,654,208
6Jun 18, 2026 17:043,09592,874,449240,905,0003,177,0002,654,208
7Jun 18, 2026 17:043,09592,870,696243,787,0001,010,0002,654,208
8Jun 18, 2026 17:043,16294,867,768246,500,00002,654,208
9Jun 18, 2026 17:043,17295,167,257245,155,0002,049,0002,654,208