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 5, 2026 12:26Victor MerckléVictor MerckléScore: 5,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 12:275,484164,540,349442,281,00013,314,0002,715,648
2May 5, 2026 12:275,505165,165,790440,415,00014,503,0002,715,648
3May 5, 2026 12:275,525165,751,521444,606,00011,702,0002,711,552
4May 5, 2026 12:275,537166,113,758443,956,00010,053,0002,994,176
5May 5, 2026 12:275,578167,345,863445,448,00013,316,0002,719,744
6May 5, 2026 12:275,609168,295,007450,452,00012,472,0002,711,552
7May 5, 2026 12:275,714171,447,106454,788,00010,133,0002,985,984
8May 5, 2026 12:275,720171,611,992452,273,00012,534,0002,977,792
9May 5, 2026 12:275,771173,135,784457,698,00010,431,0002,707,456