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 listMay 22, 2026 18:17M-RochatM-RochatScore: 20,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 18:1719,646589,385,823574,859,0004,250,0002,113,536
2May 22, 2026 18:1720,065601,951,867585,342,0004,242,0002,113,536
3May 22, 2026 18:1720,117603,510,693589,898,0004,105,0002,113,536
4May 22, 2026 18:1720,259607,793,803593,943,0004,244,0002,113,536
5May 22, 2026 18:1720,343610,312,925594,304,0004,047,0002,113,536
6May 22, 2026 18:1720,427612,817,572597,732,0004,039,0002,113,536
7May 22, 2026 18:1720,443613,294,099596,483,0004,081,0002,113,536
8May 22, 2026 18:1720,494614,830,828600,254,0004,234,0002,113,536
9May 22, 2026 18:1720,591617,745,768603,798,0004,248,0002,113,536