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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:183,22096,629,689251,504,0002,257,0002,146,304
2Jun 7, 2026 04:183,26798,039,512257,552,0001,113,0002,142,208
3Jun 7, 2026 04:183,27598,250,491256,101,0002,219,0002,142,208
4Jun 7, 2026 04:183,27798,332,117252,871,0002,314,0002,146,304
5Jun 7, 2026 04:183,28098,404,769255,273,0002,281,0002,146,304
6Jun 7, 2026 04:183,28198,432,952256,414,0002,163,0002,142,208
7Jun 7, 2026 04:183,29998,996,200257,646,0002,159,0002,142,208
8Jun 7, 2026 04:183,31999,589,978260,447,0002,181,0002,146,304
9Jun 7, 2026 04:183,338100,151,184261,622,0002,185,0002,142,208