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 6, 2026 19:06olliecrowolliecrowScore: 22,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 19:1022,337670,104,3231,833,024,00073,920,0002,850,816
2Apr 6, 2026 19:0622,607678,198,0181,847,064,00083,002,0002,764,800
3Apr 6, 2026 19:1022,622678,673,9231,853,569,00081,936,0002,584,576
4Apr 6, 2026 19:0622,677680,311,0251,858,164,00071,967,0002,682,880
5Apr 6, 2026 19:1022,713681,382,9871,835,017,00071,883,0002,777,088
6Apr 6, 2026 19:0623,099692,976,5661,856,925,00089,899,0002,772,992