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 listOct 12, 2026 02:52highload-churnerhighload-churnerScore: 9,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 02:539,419319,904,862267,761,00043,074,00024,576
2Oct 12, 2026 02:539,436320,439,816268,539,00042,875,00024,576
3Oct 12, 2026 02:539,446320,643,928268,722,00042,998,00024,576
4Oct 12, 2026 02:539,458321,286,682268,468,00043,670,00024,576
5Oct 12, 2026 02:539,478321,751,399270,051,00042,740,00024,576
6Oct 12, 2026 02:539,483321,993,209270,237,00042,726,00024,576
7Oct 12, 2026 02:539,502322,434,163270,539,00043,058,00024,576
8Oct 12, 2026 02:539,655327,568,056275,794,00042,849,00024,576
9Oct 12, 2026 02:539,759331,051,667279,135,00042,914,00024,576