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 listJul 26, 2026 23:03Andrew TsibinAndrew TsibinScore: 13,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 23:0412,987389,636,492370,510,0008,632,00045,056
2Jul 26, 2026 23:0413,007390,220,108370,447,0009,256,00045,056
3Jul 26, 2026 23:0413,010390,315,527370,705,0009,082,00045,056
4Jul 26, 2026 23:0413,024390,736,823371,175,0008,453,00045,056
5Jul 26, 2026 23:0413,045391,363,884371,144,0009,083,0002,138,112
6Jul 26, 2026 23:0413,093392,817,463372,652,0009,645,00045,056
7Jul 26, 2026 23:0413,170395,121,589375,365,0009,184,00045,056
8Jul 26, 2026 23:0413,255397,650,414377,420,0009,383,00045,056
9Jul 26, 2026 23:0413,293398,811,950377,515,0009,876,00036,864