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 listApr 21, 2026 21:57BenBenScore: 19,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 21:5819,103573,099,8291,376,630,00096,973,0002,555,904
2Apr 21, 2026 21:5819,112573,363,4021,363,351,000101,951,0002,621,440
3Apr 21, 2026 21:5819,135574,066,0781,378,998,00092,932,0002,617,344
4Apr 21, 2026 21:5819,139574,198,4781,374,354,00093,887,0002,625,536
5Apr 21, 2026 21:5819,225576,761,0381,369,505,00099,108,0002,859,008
6Apr 21, 2026 21:5819,235577,066,7891,386,506,00082,970,0002,850,816
7Apr 21, 2026 21:5819,396581,899,1121,380,135,00092,009,0002,523,136
8Apr 21, 2026 21:5819,435583,065,3121,363,419,00099,957,0002,895,872
9Apr 21, 2026 21:5819,587587,625,2261,375,703,00092,979,0002,519,040