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 listMay 3, 2026 20:32TudyMTudyMScore: 28,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:3528,473953,282,567924,089,00015,528,0002,531,328
2May 3, 2026 20:3528,506956,561,150925,013,00015,692,0002,318,336
3May 3, 2026 20:3528,590957,474,940927,761,00015,723,0002,539,520
4May 3, 2026 20:3528,698962,539,765931,476,00015,590,0002,543,616
5May 3, 2026 20:3528,828969,970,657935,691,00015,653,0002,543,616
6May 3, 2026 20:3528,999974,520,706941,375,00015,609,0002,535,424
7May 3, 2026 20:3530,8621,034,174,4791,002,750,00015,712,0002,543,616
8May 3, 2026 20:3530,9901,037,142,4281,006,981,00015,715,0002,539,520
9May 3, 2026 20:3531,0041,037,791,6541,007,542,00015,600,0002,531,328