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 listJun 7, 2026 19:25anboto1anboto1Score: 14,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:2714,400484,534,299452,511,00022,721,0002,117,632
2Jun 7, 2026 19:2714,593490,917,055458,775,00022,804,0002,117,632
3Jun 7, 2026 19:2714,647493,190,488460,784,00022,574,0002,117,632
4Jun 7, 2026 19:2714,675494,078,524461,537,00022,752,0002,117,632
5Jun 7, 2026 19:2714,709494,727,734462,753,00022,665,0002,117,632
6Jun 7, 2026 19:2714,709494,781,372462,665,00022,748,0002,117,632
7Jun 7, 2026 19:2714,726495,870,532463,328,00022,658,0002,117,632
8Jun 7, 2026 19:2714,791497,292,318465,404,00022,715,0002,117,632
9Jun 7, 2026 19:2714,820498,782,480466,293,00022,785,0002,117,632