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:07Victor MerckléVictor MerckléScore: 5,337Success
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:115,282158,471,554422,668,00015,697,0002,940,928
2May 5, 2026 12:115,302159,065,516422,720,00016,026,0002,928,640
3May 5, 2026 12:115,302159,066,342422,907,00010,271,0002,924,544
4May 5, 2026 12:115,307159,222,226426,202,00010,180,0002,924,544
5May 5, 2026 12:115,337160,121,509423,510,00010,864,0002,916,352
6May 5, 2026 12:115,341160,257,568422,916,00010,812,0002,695,168
7May 5, 2026 12:115,356160,685,932426,445,0009,858,0002,920,448
8May 5, 2026 12:115,419162,570,834430,388,00016,181,0002,707,456
9May 5, 2026 12:115,511165,331,321425,785,00010,843,0002,912,256