Unique strings Sergey Svistunov

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 listJan 20, 2026 18:52Pavel SkripkinPavel SkripkinScore: 20,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 18:5219,814678,657,791650,865,0002,999,0002,281,472
2Jan 20, 2026 18:5220,181692,902,946662,960,0002,999,0002,543,616
3Jan 20, 2026 18:5220,602701,603,963676,870,0002,999,0002,445,312
4Jan 20, 2026 18:5220,632702,482,409677,873,0002,999,0002,281,472
5Jan 20, 2026 18:5220,767709,063,164683,318,0002,000,0002,543,616
6Jan 20, 2026 18:5220,930715,539,737687,696,0002,998,0002,428,928
7Jan 20, 2026 18:5221,257726,626,012698,493,0002,997,0002,461,696
8Jan 20, 2026 18:5221,956748,524,150721,564,0002,998,0002,445,312
9Jan 20, 2026 18:5223,438799,023,915770,472,0002,997,0002,310,144