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 listApr 29, 2026 14:11TudyMTudyMScore: 11,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:1211,057331,726,022904,921,00016,998,0002,793,472
2Apr 29, 2026 14:1211,077332,316,248904,421,00012,991,0002,805,760
3Apr 29, 2026 14:1211,088332,657,736900,830,00015,996,0002,764,800
4Apr 29, 2026 14:1211,131333,949,493899,155,00018,003,0002,772,992
5Apr 29, 2026 14:1211,136334,103,216909,809,00014,996,0002,609,152
6Apr 29, 2026 14:1211,174335,221,708901,706,00015,011,0002,637,824
7Apr 29, 2026 14:1211,259337,774,503902,293,00015,987,0002,809,856
8Apr 29, 2026 14:1211,501345,058,600892,129,00019,002,0002,351,104
9Apr 29, 2026 14:1211,654349,639,519958,064,00012,987,0002,674,688