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 24, 2026 11:48olliecrowolliecrowScore: 6,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 11:496,567197,022,045498,510,0005,970,0002,703,360
2Apr 24, 2026 11:496,659199,778,085488,374,0007,005,0002,920,448
3Apr 24, 2026 11:496,757202,714,688504,458,0007,991,0002,711,552
4Apr 24, 2026 11:496,765202,960,726490,158,0005,977,0002,969,600
5Apr 24, 2026 11:496,770203,124,235509,634,0004,986,0002,703,360
6Apr 24, 2026 11:496,825204,771,717497,705,0004,987,0002,715,648
7Apr 24, 2026 11:496,833205,002,110498,577,0005,982,0002,707,456
8Apr 24, 2026 11:496,836205,109,983505,233,0007,987,0002,719,744
9Apr 24, 2026 11:496,944208,330,199493,596,0007,008,0002,715,648