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 21, 2026 18:13M-RochatM-RochatScore: 18,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:1418,321614,076,944601,602,0003,011,0002,113,536
2May 21, 2026 18:1418,322614,382,922600,585,0004,058,0002,113,536
3May 21, 2026 18:1418,379616,672,590602,405,0004,128,0002,113,536
4May 21, 2026 18:1418,480619,233,766605,834,0004,021,0002,113,536
5May 21, 2026 18:1418,601626,264,208609,755,0004,082,0002,113,536
6May 21, 2026 18:1418,657627,896,993611,660,0004,022,0002,113,536
7May 21, 2026 18:1419,634657,825,781643,911,0004,015,0002,113,536
8May 21, 2026 18:1419,772662,117,804648,455,0004,030,0002,113,536
9May 21, 2026 18:1419,773662,261,740648,436,0004,087,0002,113,536