Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 19:43TudyMTudyMScore: 31,379Success
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 19:4731,216936,494,459906,429,00010,001,0002,555,904
2May 3, 2026 19:4731,315939,469,866915,166,00010,000,0002,543,616
3May 3, 2026 19:4731,329939,885,186911,155,00011,003,0002,539,520
4May 3, 2026 19:4731,331939,952,358912,175,00011,331,0002,551,808
5May 3, 2026 19:4731,379941,384,611914,551,00011,037,0002,539,520
6May 3, 2026 19:4731,392941,761,466916,062,0009,054,0002,543,616
7May 3, 2026 19:4731,463943,898,415915,900,00010,037,0002,551,808
8May 3, 2026 19:4731,485944,577,314918,424,00010,008,0002,555,904
9May 3, 2026 19:4731,575947,257,650919,108,00011,079,0002,547,712