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 1, 2026 20:37Victor MerckléVictor MerckléScore: 6,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 20:385,954178,631,593436,183,00015,006,0002,760,704
2May 1, 2026 20:386,153184,591,674435,337,00017,013,0002,375,680
3May 1, 2026 20:386,165184,953,950439,079,00018,044,0003,010,560
4May 1, 2026 20:386,221186,636,441435,115,00016,926,0002,732,032
5May 1, 2026 20:386,253187,618,973444,432,00017,977,0002,727,936
6May 1, 2026 20:386,282188,469,735441,813,00018,949,0002,494,464
7May 1, 2026 20:386,299188,970,620453,255,00017,931,0002,764,800
8May 1, 2026 20:386,325189,755,638439,308,00017,011,0002,740,224
9May 1, 2026 20:386,501195,058,574445,223,00018,966,0002,719,744