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 listApr 21, 2026 15:44Charles CabergsCharles CabergsScore: 46,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 15:4546,0941,543,121,4121,509,114,00011,992,0002,461,696
2Apr 21, 2026 15:4546,3421,548,522,0491,518,302,00010,994,0002,461,696
3Apr 21, 2026 15:4546,6191,556,197,1541,522,435,00015,994,0002,465,792
4Apr 21, 2026 15:4546,6241,559,771,2471,525,612,00012,996,0002,465,792
5Apr 21, 2026 15:4546,6911,559,843,6051,530,831,0009,998,0002,465,792
6Apr 21, 2026 15:4546,8511,566,140,2881,533,120,00012,992,0002,318,336
7Apr 21, 2026 15:4547,0911,574,896,0681,541,020,00012,991,0002,322,432
8Apr 21, 2026 15:4547,2541,575,889,5251,545,397,00013,994,0002,469,888
9Apr 21, 2026 15:4547,2711,578,816,2041,546,957,00012,991,0002,314,240